Scalable multiparty computation with nearly optimal work and resilience

Ivan Damgard, Y. Ishai, M. Kroigaard, J.B. Nielsen, A. Smith

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    60 Citations (Scopus)
    1 Downloads (Pure)

    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.
    Original languageEnglish
    Title of host publicationProceedings of the 28th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2008), 17-21 August 2008, Santa Barbara CA, USA
    EditorsD. Wagner
    Place of PublicationBerlin
    PublisherSpringer
    Pages241-261
    ISBN (Print)978-3-540-85173-8
    DOIs
    Publication statusPublished - 2008

    Publication series

    NameLecture Notes in Computer Science
    Volume5157
    ISSN (Print)0302-9743

    Cite this