Sciweavers

5476 search results - page 59 / 1096
» Resettably Secure Computation
Sort
View
121
Voted
FC
2004
Springer
88views Cryptology» more  FC 2004»
15 years 9 months ago
Mental Models of Computer Security
Improved computer security requires improvements in risk communication to naive end users. Efficacy of risk communication depends not only on the nature of the risk, but also on t...
L. Jean Camp
126
Voted
EUROCRYPT
1998
Springer
15 years 7 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
181
Voted
FOCS
2003
IEEE
15 years 9 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
145
Voted
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 7 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
EUROCRYPT
2008
Springer
15 years 5 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