Sciweavers

102 search results - page 1 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
13 years 10 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 5 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 4 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...