Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)

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

doi:10.1007/978-3-030-03332-3_4

Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)

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

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

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

14 Scopus citations

Abstract

In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.

Original language	English
Title of host publication	Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Editors	Thomas Peyrin, Steven Galbraith
Publisher	Springer Verlag
Pages	86-117
Number of pages	32
ISBN (Print)	9783030033316
DOIs	https://doi.org/10.1007/978-3-030-03332-3_4
State	Published - 2018
Event	24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018 - Brisbane, Australia Duration: 2 Dec 2018 → 6 Dec 2018

Publication series

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

Conference

Conference	24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018
Country/Territory	Australia
City	Brisbane
Period	2/12/18 → 6/12/18

Bibliographical note

Publisher Copyright:
© 2018, International Association for Cryptologic Research.

Access to Document

10.1007/978-3-030-03332-3_4

Cite this

Hazay, C., Orsini, E., Scholl, P., & Soria-Vazquez, E. (2018). Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT). In T. Peyrin, & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 86-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11274 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03332-3_4

Hazay, Carmit ; Orsini, Emmanuela ; Scholl, Peter et al. / Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT). Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Thomas Peyrin ; Steven Galbraith. Springer Verlag, 2018. pp. 86-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{748d499e6029465fbd0a1bbc14d23009,

title = "Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)",

abstract = "In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.",

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

note = "Publisher Copyright: {\textcopyright} 2018, International Association for Cryptologic Research.; 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018 ; Conference date: 02-12-2018 Through 06-12-2018",

year = "2018",

doi = "10.1007/978-3-030-03332-3_4",

language = "אנגלית",

isbn = "9783030033316",

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

publisher = "Springer Verlag",

pages = "86--117",

editor = "Thomas Peyrin and Steven Galbraith",

booktitle = "Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

address = "גרמניה",

}

Hazay, C, Orsini, E, Scholl, P & Soria-Vazquez, E 2018, Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT). in T Peyrin & S Galbraith (eds), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11274 LNCS, Springer Verlag, pp. 86-117, 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018, Brisbane, Australia, 2/12/18. https://doi.org/10.1007/978-3-030-03332-3_4

Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT). / Hazay, Carmit; Orsini, Emmanuela; Scholl, Peter et al.
Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Thomas Peyrin; Steven Galbraith. Springer Verlag, 2018. p. 86-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11274 LNCS).

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

TY - GEN

T1 - Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)

AU - Hazay, Carmit

AU - Orsini, Emmanuela

AU - Scholl, Peter

AU - Soria-Vazquez, Eduardo

PY - 2018

Y1 - 2018

N2 - In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.

AB - In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.

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

U2 - 10.1007/978-3-030-03332-3_4

DO - 10.1007/978-3-030-03332-3_4

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

AN - SCOPUS:85057606879

SN - 9783030033316

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

SP - 86

EP - 117

BT - Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Peyrin, Thomas

A2 - Galbraith, Steven

PB - Springer Verlag

T2 - 24th Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2018

Y2 - 2 December 2018 through 6 December 2018

ER -

Hazay C, Orsini E, Scholl P, Soria-Vazquez E. Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT). In Peyrin T, Galbraith S, editors, Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2018. p. 86-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-03332-3_4

Concretely efficient large-scale MPC with active security (or, tinykeys for TinyOT)

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this