53 search results - page 1 / 11 » Minimal Complete Primitives for Secure Multi-party Computati... |
STOC
1996
ACM
13 years 8 months ago
1996
ACM
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 ...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
EUROCRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
FOCS
2003
IEEE
13 years 9 months ago
2003
IEEE
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...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...