Founding cryptography on oblivious transfer - Efficiently

Yuval Ishai, Manoj Prabhakaran, Amit Sahai

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

    Abstract

    We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee security with no honest majority, in the oblivious-transfer (OT) hybrid model. Our technique works by combining a secure protocol in the honest majority setting with a protocol achieving only security against semi-honest parties in the setting of no honest majority. Applying our compiler to variants of protocols from the literature, we get several applications for secure two-party computation and for MPC with no honest majority. These include: Constant-rate two-party computation in the OT-hybrid model. We obtain a statistically UC-secure two-party protocol in the OT-hybrid model that can evaluate a general circuit C of size s and depth d with a total communication complexity of O(s)∈+∈poly(k, d, log s) and O(d) rounds. The above result generalizes to a constant number of parties. Extending OTs in the malicious model. We obtain a computationally efficient protocol for generating many string OTs from few string OTs with only a constant amortized communication overhead compared to the total length of the string OTs. Black-box constructions for constant-round MPC with no honest majority. We obtain general computationally UC-secure MPC protocols in the OT-hybrid model that use only a constant number of rounds, and only make a black-box access to a pseudorandom generator. This gives the first constant-round protocols for three or more parties that only make a black-box use of cryptographic primitives (and avoid expensive zero-knowledge proofs).

    Original languageEnglish (US)
    Title of host publicationAdvances in Cryptology - CRYPTO 2008 - 28th Annual International Cryptology Conference, Proceedings
    Pages572-591
    Number of pages20
    DOIs
    StatePublished - 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
    Country/TerritoryUnited States
    CitySanta Barbara, CA
    Period8/17/088/21/08

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Founding cryptography on oblivious transfer - Efficiently'. Together they form a unique fingerprint.

    Cite this