A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Exact Round Complexity of Self-composable Two-Party Computation
[chapter]
2017
Lecture Notes in Computer Science
The round complexity of secure computation has been a fundamental problem in cryptography. Katz and Ostrovsky proved that 5 rounds are both necessary and sufficient for secure computation in the stand alone setting, thus resolving the exact round complexity of standalone secure computation. In contrast, round complexity of secure computation in the concurrent setting, where several protocols may run simultaneously, is poorly understood. Since standard polynomial time simulation is impossible in
doi:10.1007/978-3-319-56614-6_7
fatcat:xyxs3fpt6bchnpm6lrcd43md6e