Name
Abstract | ||
|---|---|---|
We construct a 4-round multi-party computation protocol in the plain model for any functionality, secure against a malicious adversary. Our protocol relies on the sub-exponential hardness of the Learning with Errors (LWE) problem with slightly super-polynomial noise ratio, and on the existence of adaptively secure commitments based on standard assumptions. Our round complexity matches a lower bound of Garg et al. (EUROCRYPT ’16), and outperforms the state of the art of 6 rounds based on similar assumptions to ours, and 5 rounds relying on indistinguishability obfuscation and other strong assumptions. |
Year | Venue | DocType |
|---|---|---|
2017 | IACR Cryptology ePrint Archive | Conference |
Volume | Citations | PageRank |
2017 | 7 | 0.42 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zvika Brakerski | 1 | 2353 | 92.25 |
| Shai Halevi | 2 | 7203 | 442.70 |
| Antigoni Polychroniadou | 3 | 100 | 8.00 |