TY - GEN
T1 - Scalable secure multiparty computation
AU - Damgård, Ivan
AU - Ishai, Yuval
PY - 2006
Y1 - 2006
N2 - We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant number rounds assuming the existence of a "computationally simple" pseudorandom generator, or in a small non-constant number of rounds assuming an arbitrary pseudorandom generator.
AB - We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant number rounds assuming the existence of a "computationally simple" pseudorandom generator, or in a small non-constant number of rounds assuming an arbitrary pseudorandom generator.
UR - http://www.scopus.com/inward/record.url?scp=33749557660&partnerID=8YFLogxK
U2 - 10.1007/11818175_30
DO - 10.1007/11818175_30
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33749557660
SN - 3540374329
SN - 9783540374329
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 501
EP - 520
BT - Advances in Cryptology - CRYPTO 2006 - 26th Annual International Cryptology Conference, Proceedings
T2 - 26th Annual International Cryptology Conference, CRYPTO 2006
Y2 - 20 August 2006 through 24 August 2006
ER -