9 search results - page 2 / 2 » Protocols for Multiparty Coin Toss with Dishonest Majority |
EUROCRYPT
2011
Springer
13 years 1 months ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
SIAMCOMP
1998
13 years 10 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
EUROCRYPT
2008
Springer
14 years 3 days 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...
EUROCRYPT
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...