@inproceedings{27c913fa6dfb40a6b8a1e4a2f9b3729b,

title = "Scalable multiparty computation with nearly optimal work and resilience",

abstract = "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¿-¿e) fraction of the players, for an arbitrary e>¿0.",

author = "Ivan Damgard and Y. Ishai and M. Kroigaard and J.B. Nielsen and A. Smith",

year = "2008",

doi = "10.1007/978-3-540-85174-5_14",

language = "English",

isbn = "978-3-540-85173-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "241--261",

editor = "D. Wagner",

booktitle = "Proceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA",

address = "Germany",

}