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

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

doi:10.1007/978-3-662-53641-4_21

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

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

CS@BIU

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 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 language	English
Title of host publication	Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings
Editors	Adam Smith, Martin Hirt
Publisher	Springer Verlag
Pages	554-581
Number of pages	28
ISBN (Print)	9783662536407
DOIs	https://doi.org/10.1007/978-3-662-53641-4_21
State	Published - 2016
Event	14th International Conference on Theory of Cryptography, TCC 2016-B - Beijing, China Duration: 31 Oct 2016 → 3 Nov 2016

Publication series

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

Conference

Conference	14th International Conference on Theory of Cryptography, TCC 2016-B
Country/Territory	China
City	Beijing
Period	31/10/16 → 3/11/16

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2016.

Access to Document

10.1007/978-3-662-53641-4_21

Cite this

Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016). More efficient constant-round multi-party computation from BMR and SHE. In A. Smith, & M. Hirt (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (pp. 554-581). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9985 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-53641-4_21

Lindell, Yehuda ; Smart, Nigel P. ; Soria-Vazquez, Eduardo. / More efficient constant-round multi-party computation from BMR and SHE. Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. editor / Adam Smith ; Martin Hirt. Springer Verlag, 2016. pp. 554-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{583b6ce5ef2f441da617aad14e2d6aae,

title = "More efficient constant-round multi-party computation from BMR and SHE",

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{\textquoteright}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{\textquoteright}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.",

author = "Yehuda Lindell and Smart, {Nigel P.} and Eduardo Soria-Vazquez",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 14th International Conference on Theory of Cryptography, TCC 2016-B ; Conference date: 31-10-2016 Through 03-11-2016",

year = "2016",

doi = "10.1007/978-3-662-53641-4_21",

language = "אנגלית",

isbn = "9783662536407",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "554--581",

editor = "Adam Smith and Martin Hirt",

booktitle = "Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings",

address = "גרמניה",

}

Lindell, Y, Smart, NP & Soria-Vazquez, E 2016, More efficient constant-round multi-party computation from BMR and SHE. in A Smith & M Hirt (eds), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9985 LNCS, Springer Verlag, pp. 554-581, 14th International Conference on Theory of Cryptography, TCC 2016-B, Beijing, China, 31/10/16. https://doi.org/10.1007/978-3-662-53641-4_21

More efficient constant-round multi-party computation from BMR and SHE. / Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo.
Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. ed. / Adam Smith; Martin Hirt. Springer Verlag, 2016. p. 554-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9985 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Lindell, Yehuda

AU - Smart, Nigel P.

AU - Soria-Vazquez, Eduardo

N1 - Publisher Copyright: © International Association for Cryptologic Research 2016.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84994410742&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-53641-4_21

DO - 10.1007/978-3-662-53641-4_21

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84994410742

SN - 9783662536407

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 554

EP - 581

BT - Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings

A2 - Smith, Adam

A2 - Hirt, Martin

PB - Springer Verlag

T2 - 14th International Conference on Theory of Cryptography, TCC 2016-B

Y2 - 31 October 2016 through 3 November 2016

ER -

Lindell Y, Smart NP, Soria-Vazquez E. More efficient constant-round multi-party computation from BMR and SHE. In Smith A, Hirt M, editors, Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings. Springer Verlag. 2016. p. 554-581. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-53641-4_21

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this