TinyKeys: A new approach to efficient multi-party computation

Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez

doi:10.1007/978-3-319-96878-0_1

TinyKeys: A new approach to efficient multi-party computation

Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez

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

20 Scopus citations

Abstract

We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting the efficiency of most practical protocols does not depend on the number of honest parties, we investigate how to construct protocols which improve in efficiency as the number of honest parties increases. Our central idea is to take a protocol which is secure for n- 1 corruptions and modify it to use short symmetric keys, with the aim of basing security on the concatenation of all honest parties’ keys. This results in a more efficient protocol tolerating fewer corruptions, whilst also introducing an LPN-style syndrome decoding assumption. We first apply this technique to a modified version of the semi-honest GMW protocol, using OT extension with short keys, to improve the efficiency of standard GMW with fewer corruptions. We also obtain more efficient constant-round MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol. Our techniques start to improve upon existing protocols when there are around n= 20 parties with h= 6 honest parties, and as these increase we obtain up to a 13 times reduction (for n= 400, h= 120) in communication complexity for our GMW variant, compared with the best-known GMW-based protocol modified to use the same threshold.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings
Editors	Hovav Shacham, Alexandra Boldyreva
Publisher	Springer Verlag
Pages	3-33
Number of pages	31
ISBN (Print)	9783319968773
DOIs	https://doi.org/10.1007/978-3-319-96878-0_1
State	Published - 2018
Event	38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States Duration: 19 Aug 2018 → 23 Aug 2018

Publication series

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

Conference

Conference	38th Annual International Cryptology Conference, CRYPTO 2018
Country/Territory	United States
City	Santa Barbara
Period	19/08/18 → 23/08/18

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2018.

Funding

We first apply this technique to a modified version of the semi-honest GMW protocol, using OT extension with short keys, to improve the efficiency of standard GMW with fewer corruptions. We also obtain more efficient constant-round MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol. Our techniques start to improve upon existing protocols when there are around n = 20 parties with h = 6 honest parties, and as these increase we obtain up to a 13 times reduction (for n = 400,h = 120) C. Hazay—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. E. Orsini—Supported in part by ERC Advanced Grant ERC-2015-AdG-IMPaCT. P. Scholl—Supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 731583 (SODA), and the Danish Independent Research Council under Grant-ID DFF-6108-00169 (FoCC). E. Soria-Vazquez—Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 643161, and by ERC Advanced Grant ERC-2015-AdG-IMPaCT. C. Hazay—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. E. Orsini—Supported in part by ERC Advanced Grant ERC-2015-AdG-IMPaCT. P. Scholl—Supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 731583 (SODA), and the Danish Independent Research Council under Grant-ID DFF-6108-00169 (FoCC). E. Soria-Vazquez—Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk̷lodowska-Curie grant agreement No. 643161, and by ERC Advanced Grant ERC-2015-AdG-IMPaCT.

Funders	Funder number
FoCC
Marie Sk lodowska-Curie
SODA
Natur og Univers, Det Frie Forskningsråd	DFF-6108-00169
Horizon 2020 Framework Programme	690978, 731583
European Commission	ERC-2015-AdG-IMPaCT
Horizon 2020	643161

Access to Document

10.1007/978-3-319-96878-0_1

Cite this

Hazay, C., Orsini, E., Scholl, P., & Soria-Vazquez, E. (2018). TinyKeys: A new approach to efficient multi-party computation. In H. Shacham, & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (pp. 3-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10993 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-96878-0_1

Hazay, Carmit ; Orsini, Emmanuela ; Scholl, Peter et al. / TinyKeys : A new approach to efficient multi-party computation. Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. editor / Hovav Shacham ; Alexandra Boldyreva. Springer Verlag, 2018. pp. 3-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{47e560f11faf484b9015c179cd967e04,

title = "TinyKeys: A new approach to efficient multi-party computation",

abstract = "We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting the efficiency of most practical protocols does not depend on the number of honest parties, we investigate how to construct protocols which improve in efficiency as the number of honest parties increases. Our central idea is to take a protocol which is secure for n- 1 corruptions and modify it to use short symmetric keys, with the aim of basing security on the concatenation of all honest parties{\textquoteright} keys. This results in a more efficient protocol tolerating fewer corruptions, whilst also introducing an LPN-style syndrome decoding assumption. We first apply this technique to a modified version of the semi-honest GMW protocol, using OT extension with short keys, to improve the efficiency of standard GMW with fewer corruptions. We also obtain more efficient constant-round MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol. Our techniques start to improve upon existing protocols when there are around n= 20 parties with h= 6 honest parties, and as these increase we obtain up to a 13 times reduction (for n= 400, h= 120) in communication complexity for our GMW variant, compared with the best-known GMW-based protocol modified to use the same threshold.",

author = "Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 38th Annual International Cryptology Conference, CRYPTO 2018 ; Conference date: 19-08-2018 Through 23-08-2018",

year = "2018",

doi = "10.1007/978-3-319-96878-0_1",

language = "אנגלית",

isbn = "9783319968773",

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

publisher = "Springer Verlag",

pages = "3--33",

editor = "Hovav Shacham and Alexandra Boldyreva",

booktitle = "Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings",

address = "גרמניה",

}

Hazay, C, Orsini, E, Scholl, P & Soria-Vazquez, E 2018, TinyKeys: A new approach to efficient multi-party computation. in H Shacham & A Boldyreva (eds), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10993 LNCS, Springer Verlag, pp. 3-33, 38th Annual International Cryptology Conference, CRYPTO 2018, Santa Barbara, United States, 19/08/18. https://doi.org/10.1007/978-3-319-96878-0_1

TinyKeys: A new approach to efficient multi-party computation. / Hazay, Carmit; Orsini, Emmanuela; Scholl, Peter et al.
Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. ed. / Hovav Shacham; Alexandra Boldyreva. Springer Verlag, 2018. p. 3-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10993 LNCS).

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

TY - GEN

T1 - TinyKeys

T2 - 38th Annual International Cryptology Conference, CRYPTO 2018

AU - Hazay, Carmit

AU - Orsini, Emmanuela

AU - Scholl, Peter

AU - Soria-Vazquez, Eduardo

PY - 2018

Y1 - 2018

N2 - We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting the efficiency of most practical protocols does not depend on the number of honest parties, we investigate how to construct protocols which improve in efficiency as the number of honest parties increases. Our central idea is to take a protocol which is secure for n- 1 corruptions and modify it to use short symmetric keys, with the aim of basing security on the concatenation of all honest parties’ keys. This results in a more efficient protocol tolerating fewer corruptions, whilst also introducing an LPN-style syndrome decoding assumption. We first apply this technique to a modified version of the semi-honest GMW protocol, using OT extension with short keys, to improve the efficiency of standard GMW with fewer corruptions. We also obtain more efficient constant-round MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol. Our techniques start to improve upon existing protocols when there are around n= 20 parties with h= 6 honest parties, and as these increase we obtain up to a 13 times reduction (for n= 400, h= 120) in communication complexity for our GMW variant, compared with the best-known GMW-based protocol modified to use the same threshold.

AB - We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting the efficiency of most practical protocols does not depend on the number of honest parties, we investigate how to construct protocols which improve in efficiency as the number of honest parties increases. Our central idea is to take a protocol which is secure for n- 1 corruptions and modify it to use short symmetric keys, with the aim of basing security on the concatenation of all honest parties’ keys. This results in a more efficient protocol tolerating fewer corruptions, whilst also introducing an LPN-style syndrome decoding assumption. We first apply this technique to a modified version of the semi-honest GMW protocol, using OT extension with short keys, to improve the efficiency of standard GMW with fewer corruptions. We also obtain more efficient constant-round MPC, using BMR-style garbled circuits with short keys, and present an implementation of the online phase of this protocol. Our techniques start to improve upon existing protocols when there are around n= 20 parties with h= 6 honest parties, and as these increase we obtain up to a 13 times reduction (for n= 400, h= 120) in communication complexity for our GMW variant, compared with the best-known GMW-based protocol modified to use the same threshold.

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

U2 - 10.1007/978-3-319-96878-0_1

DO - 10.1007/978-3-319-96878-0_1

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

AN - SCOPUS:85052384333

SN - 9783319968773

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

SP - 3

EP - 33

BT - Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings

A2 - Shacham, Hovav

A2 - Boldyreva, Alexandra

PB - Springer Verlag

Y2 - 19 August 2018 through 23 August 2018

ER -

Hazay C, Orsini E, Scholl P, Soria-Vazquez E. TinyKeys: A new approach to efficient multi-party computation. In Shacham H, Boldyreva A, editors, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Springer Verlag. 2018. p. 3-33. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-96878-0_1

TinyKeys: A new approach to efficient multi-party computation

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this