Name
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]. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-90459-3_22 | THEORY OF CRYPTOGRAPHY, TCC 2021, PT I |
DocType | Volume | ISSN |
Conference | 13042 | 0302-9743 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amit Agarwal | 1 | 693 | 72.95 |
| James Bartusek | 2 | 3 | 1.41 |
| Vipul Goyal | 3 | 2859 | 129.53 |
| Dakshita Khurana | 4 | 57 | 11.60 |
| Giulio Malavolta | 5 | 31 | 11.36 |