Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

Amit Agarwal; James Bartusek; Vipul Goyal; Dakshita Khurana; Giulio Malavolta

doi:10.1007/978-3-030-90459-3_22

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta

Siebel School of Computing and Data Science

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

Abstract

We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques introduced in [Benhamouda and Lin, TCC 2020].

Original language	English (US)
Title of host publication	Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings
Editors	Kobbi Nissim, Brent Waters, Brent Waters
Publisher	Springer
Pages	654-685
Number of pages	32
ISBN (Print)	9783030904586
DOIs	https://doi.org/10.1007/978-3-030-90459-3_22
State	Published - 2021
Event	19th International Conference on Theory of Cryptography, TCC 2021 - Raleigh, United States Duration: Nov 8 2021 → Nov 11 2021

Publication series

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

Conference

Conference	19th International Conference on Theory of Cryptography, TCC 2021
Country/Territory	United States
City	Raleigh
Period	11/8/21 → 11/11/21

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-030-90459-3_22

Library availability

Discover UIUC Full Text

Cite this

Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., & Malavolta, G. (2021). Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. In K. Nissim, B. Waters, & B. Waters (Eds.), Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 654-685). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13042 LNCS). Springer. https://doi.org/10.1007/978-3-030-90459-3_22

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. / Agarwal, Amit; Bartusek, James; Goyal, Vipul et al.
Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. ed. / Kobbi Nissim; Brent Waters; Brent Waters. Springer, 2021. p. 654-685 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13042 LNCS).

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

Agarwal, A, Bartusek, J, Goyal, V, Khurana, D & Malavolta, G 2021, Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. in K Nissim, B Waters & B Waters (eds), Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13042 LNCS, Springer, pp. 654-685, 19th International Conference on Theory of Cryptography, TCC 2021, Raleigh, United States, 11/8/21. https://doi.org/10.1007/978-3-030-90459-3_22

Agarwal A, Bartusek J, Goyal V, Khurana D, Malavolta G. Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. In Nissim K, Waters B, Waters B, editors, Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. Springer. 2021. p. 654-685. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-90459-3_22

Agarwal, Amit ; Bartusek, James ; Goyal, Vipul et al. / Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings. editor / Kobbi Nissim ; Brent Waters ; Brent Waters. Springer, 2021. pp. 654-685 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d41d08955ef24eab9d8759122a0d39c7,

title = "Two-Round Maliciously Secure Computation with Super-Polynomial Simulation",

abstract = "We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques introduced in [Benhamouda and Lin, TCC 2020].",

author = "Amit Agarwal and James Bartusek and Vipul Goyal and Dakshita Khurana and Giulio Malavolta",

note = "Publisher Copyright: {\textcopyright} 2021, International Association for Cryptologic Research.; 19th International Conference on Theory of Cryptography, TCC 2021 ; Conference date: 08-11-2021 Through 11-11-2021",

year = "2021",

doi = "10.1007/978-3-030-90459-3_22",

language = "English (US)",

isbn = "9783030904586",

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

publisher = "Springer",

pages = "654--685",

editor = "Kobbi Nissim and Brent Waters and Brent Waters",

booktitle = "Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

AU - Agarwal, Amit

AU - Bartusek, James

AU - Goyal, Vipul

AU - Khurana, Dakshita

AU - Malavolta, Giulio

PY - 2021

Y1 - 2021

N2 - We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques introduced in [Benhamouda and Lin, TCC 2020].

AB - We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques introduced in [Benhamouda and Lin, TCC 2020].

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

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

U2 - 10.1007/978-3-030-90459-3_22

DO - 10.1007/978-3-030-90459-3_22

M3 - Conference contribution

AN - SCOPUS:85120073044

SN - 9783030904586

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

SP - 654

EP - 685

BT - Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings

A2 - Nissim, Kobbi

A2 - Waters, Brent

PB - Springer

T2 - 19th International Conference on Theory of Cryptography, TCC 2021

Y2 - 8 November 2021 through 11 November 2021

ER -

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this