Efficient Pseudorandom Correlation Generators: Silent OT Extension and More * - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More *

Geoffroy Couteau
Elette Boyle
  • Fonction : Auteur
Niv Gilboa
  • Fonction : Auteur
Yuval Ishai
  • Fonction : Auteur
Lisa Kohl
  • Fonction : Auteur
Peter Scholl
  • Fonction : Auteur
Idc Herzliya
  • Fonction : Auteur

Résumé

Secure multiparty computation (MPC) often relies on sources of correlated randomness for better efficiency and simplicity. This is particularly useful for MPC with no honest majority, where input-independent correlated randomness enables a lightweight "non-cryptographic" online phase once the inputs are known. However, since the amount of correlated randomness typically scales with the circuit size of the function being computed, securely generating correlated randomness forms an efficiency bottleneck, involving a large amount of communication and storage. A natural tool for addressing the above limitations is a pseudorandom correlation generator (PCG). A PCG allows two or more parties to securely generate long sources of useful correlated randomness via a local expansion of correlated short seeds and no interaction. PCGs enable MPC with silent preprocessing, where a small amount of interaction used for securely sampling the seeds is followed by silent local generation of correlated pseudorandomness. A concretely efficient PCG for Vector-OLE correlations was recently obtained by Boyle et al. (CCS 2018) based on variants of the learning parity with noise (LPN) assumption over large fields. In this work, we initiate a systematic study of PCGs and present concretely efficient constructions for several types of useful MPC correlations. We obtain the following main contributions:-PCG foundations. We give a general security definition for PCGs. Our definition suffices for any MPC protocol satisfying a stronger security requirement that is met by existing protocols. We prove that a stronger security requirement is indeed necessary, and justify our PCG definition by ruling out a stronger and more natural definition.-Silent OT extension. We present the first concretely efficient PCG for oblivious transfer correlations. Its security is based on a variant of the binary LPN assumption and any correlationrobust hash function. We expect it to provide a faster alternative to the IKNP OT extension protocol (Crypto '03) when communication is the bottleneck. We present several applications, including protocols for non-interactive zero-knowledge with bounded-reusable preprocessing from binary LPN, and concretely efficient related-key oblivious pseudorandom functions.-PCGs for simple 2-party correlations. We obtain PCGs for several other types of useful 2-party correlations, including (authenticated) one-time truth-tables and Beaver triples. While the latter PCGs are slower than our PCG for OT, they are still practically feasible. These PCGs are based on a host of assumptions and techniques, including specialized homomorphic secret sharing schemes and pseudorandom generators tailored to their structure.-Multiparty correlations. We obtain PCGs for multiparty correlations that can be used to make the circuit-dependent communication of MPC protocols scale linearly (instead of quadratically) with the number of parties.
Fichier principal
Vignette du fichier
2019-448.pdf (1.12 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03373123 , version 1 (11-10-2021)

Identifiants

Citer

Geoffroy Couteau, Elette Boyle, Niv Gilboa, Yuval Ishai, Lisa Kohl, et al.. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More *. CRYPTO 2019 - Annual International Cryptology Conference, Aug 2019, Santa Barabara, United States. pp.489-518, ⟨10.1007/978-3-030-26954-8_16⟩. ⟨hal-03373123⟩
19 Consultations
430 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More