Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

On the Round Complexity Landscape of Secure Multi-party Computation

Divya Ravi

Published Jan 18, 2021• 0 citations
OpenAlex

Related papers

Round-Optimal Secure Multi-Party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

Lecture notes in computer science•Jan 1, 2018•37 citations

Round-Optimal Secure Multi-party Computation

Shai Halevi, Carmit Hazay, Antigoni Polychroniadou +1 more

Journal of Cryptology•May 13, 2021•14 citations

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Aug 18, 2021•1 citation

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2018•34 citations

Towards secure multi-party computation on the Internet : few rounds and many parties

Eduardo Soria-Vázquez

•Jan 1, 2019•3 citations

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Jun 29, 2023•0 citations