TY - GEN
T1 - Scalable multiparty computation with nearly optimal work and resilience
AU - Damgård, Ivan
AU - Ishai, Yuval
AU - Krøigaard, Mikkel
AU - Nielsen, Jesper Buus
AU - Smith, Adam
PY - 2008
Y1 - 2008
N2 - We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2 - ε) fraction of the players, for an arbitrary ε > 0.
AB - We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2 - ε) fraction of the players, for an arbitrary ε > 0.
UR - http://www.scopus.com/inward/record.url?scp=51849125042&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85174-5_14
DO - 10.1007/978-3-540-85174-5_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:51849125042
SN - 3540851739
SN - 9783540851738
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 241
EP - 261
BT - Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings
T2 - 28th Annual International Cryptology Conference, CRYPTO 2008
Y2 - 17 August 2008 through 21 August 2008
ER -