24 search results - page 2 / 5 » Quorum-Based Secure Multi-party Computation |
STOC
1996
ACM
13 years 9 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 ...
DGO
2004
13 years 6 months ago
2004
EUROCRYPT
2008
Springer
13 years 7 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...
SACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
EUROCRYPT
1998
Springer
13 years 9 months ago
1998
Springer
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...