Sciweavers

6164 search results - page 108 / 1233
» Teaching Computer Security
Sort
View
EUROCRYPT
2008
Springer
15 years 8 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
P2P
2008
IEEE
16 years 20 days ago
Peer-to-Peer Secure Multi-party Numerical Computation
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
16 years 27 days ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas
GCA
2009
15 years 4 months ago
Enhancing Grid Security Using Workflows, Trusted Computing and Virtualisation
This paper highlights the need to meet both Grid user and resource provider security requirements, describing the rationale for securing Grid workflows: a set of tasks arranged int...
Po-Wah Yau, Allan Tomlinson
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz