More efficient constant-round multi-party computation from BMR and SHE

Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez

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

32 Scopus citations

Abstract

We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry’s Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al. (CRYPTO 2015). Our protocol avoids various inefficiencies of the previous two protocols. Compared to Gentry’s protocol we only require Somewhat Homomorphic Encryption (SHE). Whilst in comparison to the SPDZ-BMR protocol we require only a quadratic complexity in the number of players (as opposed to cubic), we have fewer rounds, and we require less proofs of correctness of ciphertexts. Additionally, we present a variant of our protocol which trades the depth of the garbling circuit (computed using SHE) for some more multiplications in the offline and online phases.

Original languageEnglish
Title of host publicationTheory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings
EditorsAdam Smith, Martin Hirt
PublisherSpringer Verlag
Pages554-581
Number of pages28
ISBN (Print)9783662536407
DOIs
StatePublished - 2016
Event14th International Conference on Theory of Cryptography, TCC 2016-B - Beijing, China
Duration: 31 Oct 20163 Nov 2016

Publication series

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

Conference

Conference14th International Conference on Theory of Cryptography, TCC 2016-B
Country/TerritoryChina
CityBeijing
Period31/10/163/11/16

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2016.

Funding

FundersFunder number
Horizon 2020 Framework Programme643161
Engineering and Physical Sciences Research CouncilEP/M012824/1, EP/N021940/1, EP/I03126X/1

    Fingerprint

    Dive into the research topics of 'More efficient constant-round multi-party computation from BMR and SHE'. Together they form a unique fingerprint.

    Cite this