International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Authors:
Fabrice Benhamouda
Huijia Lin
Antigoni Polychroniadou
Muthuramakrishnan Venkitasubramaniam
Download:
DOI: 10.1007/978-3-030-03807-6_7
Search ePrint
Search Google
Conference: TCC 2018
Abstract: We present the first two-round multiparty computation (MPC) protocols secure against malicious adaptive corruption in the common reference string (CRS) model, based on DDH, LWE, or QR. Prior two-round adaptively secure protocols were known only in the two-party setting against semi-honest adversaries, or in the general multiparty setting assuming the existence of indistinguishability obfuscation (iO).Our protocols are constructed in two steps. First, we construct two-round oblivious transfer (OT) protocols secure against malicious adaptive corruption in the CRS model based on DDH, LWE, or QR. We achieve this by generically transforming any two-round OT that is only secure against static corruption but has certain oblivious sampleability properties, into a two-round adaptively secure OT. Prior constructions were only secure against semi-honest adversaries or based on iO.Second, building upon recent constructions of two-round MPC from two-round OT in the weaker static corruption setting [Garg and Srinivasan, Benhamouda and Lin, Eurocrypt’18] and using equivocal garbled circuits from [Canetti, Poburinnaya and Venkitasubramaniam, STOC’17], we show how to construct two-round adaptively secure MPC from two-round adaptively secure OT and constant-round adaptively secure MPC, with respect to both malicious and semi-honest adversaries. As a corollary, we also obtain the first 2-round MPC secure against semi-honest adaptive corruption in the plain model based on augmented non-committing encryption (NCE), which can be based on a variety of assumptions, CDH, RSA, DDH, LWE, or factoring Blum integers. Finally, we mention that our OT and MPC protocols in the CRS model are, in fact, adaptively secure in the Universal Composability framework.
BibTeX
@inproceedings{tcc-2018-29008,
  title={Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions},
  booktitle={Theory of Cryptography},
  series={Theory of Cryptography},
  publisher={Springer},
  volume={11239},
  pages={175-205},
  doi={10.1007/978-3-030-03807-6_7},
  author={Fabrice Benhamouda and Huijia Lin and Antigoni Polychroniadou and Muthuramakrishnan Venkitasubramaniam},
  year=2018
}