Scalable multiparty computation with nearly optimal work and resilience

Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

54 Scopus citations

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 - ε) fraction of the players, for an arbitrary ε > 0.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings
Pages241-261
Number of pages21
DOIs
Publication statusPublished - Sep 22 2008
Event28th Annual International Cryptology Conference, CRYPTO 2008 - Santa Barbara, CA, United States
Duration: Aug 17 2008Aug 21 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5157 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other28th Annual International Cryptology Conference, CRYPTO 2008
CountryUnited States
CitySanta Barbara, CA
Period8/17/088/21/08

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Damgård, I., Ishai, Y., Krøigaard, M., Nielsen, J. B., & Smith, A. (2008). Scalable multiparty computation with nearly optimal work and resilience. In Advances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings (pp. 241-261). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5157 LNCS). https://doi.org/10.1007/978-3-540-85174-5_14