Lecture notes in computer science

On the Exact Round Complexity of Self-composable Two-Party Computation

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Published Jan 1, 2017• 9 citations

Related papers

Universally-Composable Two-Party Computation in Two Rounds

Omer Horvitz, Jonathan I. Katz

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation

Arpita Patra, Divya Ravi, Swati Singla

Round-Efficient Composable Two-Party Quantum Computation

Vipul Goyal, Xiao Rong Liang, Omkant Pandey +2 more

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

Susumu Kiyoshima