Low cost constant round MPC combining BMR and oblivious transfer

Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez

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

49 Scopus citations

Abstract

In this work, we present two new universally composable, actively secure, constant round multi-party protocols for generating BMR garbled circuits with free-XOR and reduced costs. 1.Our first protocol takes a generic approach using any secret-sharing based MPC protocol for binary circuits, and a correlated oblivious transfer functionality.2.Our specialized protocol uses secret-sharing based MPC with information-theoretic MACs. This approach is less general, but requires no additional correlated OTs to compute the garbled circuit. In both approaches, the underlying secret-sharing based protocol is only used for one secure F2 multiplication per AND gate. An interesting consequence of this is that, with current techniques, constant round MPC for binary circuits is not much more expensive than practical, non-constant round protocols. We demonstrate the practicality of our second protocol with an implementation, and perform experiments with up to 9 parties securely computing the AES and SHA-256 circuits. Our running times improve upon the best possible performance with previous BMR-based protocols by 60 times.

Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
EditorsTsuyoshi Takagi, Thomas Peyrin
PublisherSpringer Verlag
Pages598-628
Number of pages31
ISBN (Print)9783319706931
DOIs
StatePublished - 2017
Event23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017 - Hong Kong, Hong Kong
Duration: 3 Dec 20177 Dec 2017

Publication series

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

Conference

Conference23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017
Country/TerritoryHong Kong
CityHong Kong
Period3/12/177/12/17

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2017.

Funding

The first author was supported by the European Research Council under the ERC consolidators grant agreement No. 615172 (HIPS), and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. The second author was supported by the Defense Advanced Research Projects Agency (DARPA) and Space and Naval Warfare Systems Center, Pacific (SSC Pacific) under contract No. N66001-15-C-4070, and by the Danish Independent Research Council, Grant-ID DFF-6108-00169. The third author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 643161.

FundersFunder number
Danish Independent Research CouncilDFF-6108-00169
Marie Sk lodowska-Curie
Space and Naval Warfare Systems CenterN66001-15-C-4070
Defense Advanced Research Projects Agency
Horizon 2020 Framework Programme731583, 643161
European Commission615172

    Fingerprint

    Dive into the research topics of 'Low cost constant round MPC combining BMR and oblivious transfer'. Together they form a unique fingerprint.

    Cite this