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

Lecture notes in computer science

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

Arpita Patra, Divya Ravi, Swati Singla

Published Jan 1, 2020• 2 citations
Publisher
DOI
10.1007/978-3-030-64840-4_3

Related papers

On the Round Complexity Landscape of Secure Multi-party Computation

Divya Ravi

•Jan 18, 2021•0 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

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Aug 18, 2021•1 citation

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

Arpita Patra, Divya Ravi

Lecture notes in computer science•Jan 1, 2019•9 citations

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

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

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

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey

Lecture notes in computer science•Jan 1, 2017•9 citations