Name
Abstract | ||
|---|---|---|
One fundamental complexity measure of an MPC protocol is its round complexity. Asharov et al. recently constructed the first three-round protocol for general MPC in the CRS model. Here, we show how to achieve this result with only two rounds. We obtain UC security with abort against static malicious adversaries, and fairness if there is an honest majority. Additionally the communication in our protocol is only proportional to the input and output size of the function being evaluated and independent of its circuit size. Our main tool is indistinguishability obfuscation, for which a candidate construction was recently proposed by Garg et al. The technical tools that we develop in this work also imply virtual black box obfuscation of a new primitive that we call a dynamic point function. This primitive may be of independent interest. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-54242-8_4 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Journal | 8349 | 0302-9743 |
Citations | PageRank | References |
71 | 1.56 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjam Garg | 1 | 1710 | 69.92 |
| Craig Gentry | 2 | 9520 | 380.03 |
| Shai Halevi | 3 | 7203 | 442.70 |
| Mariana Raykova | 4 | 1781 | 63.97 |