Name
Abstract | ||
|---|---|---|
We revisit the exact round complexity of secure two-party computation. While four rounds are known to be sufficient for securely computing general functions that provide output to one party [Katz-Ostrovsky, CRYPTO’04], Goldreich-Krawczyk [SIAM J. Computing’96] proved that three rounds are insufficient for this task w.r.t. black-box simulation. |
Year | Venue | DocType |
|---|---|---|
2017 | TCC | Journal |
Volume | Citations | PageRank |
2017 | 1 | 0.35 |
References | Authors | |
23 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prabhanjan Ananth | 1 | 234 | 18.43 |
| Abhishek Jain | 2 | 879 | 48.25 |