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 Secure Three-Party Computation

Arpita Patra, Divya Ravi

Published Jan 1, 2018• 34 citations
Publisher
DOI
10.1007/978-3-319-96881-0_15

Related papers

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Aug 18, 2021•1 citation

On the Round Complexity Landscape of Secure Multi-party Computation

Divya Ravi

•Jan 18, 2021•0 citations

On Secure Two-Party Computation in Three Rounds

Prabhanjan Ananth, Abhishek Jain

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

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

Arpita Patra, Divya Ravi, Swati Singla

Lecture notes in computer science•Jan 1, 2020•2 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

The Exact Round Complexity of Secure Computation

Sanjam Garg, Pratyay Mukherjee, Omkant Pandey +1 more

Lecture notes in computer science•Jan 1, 2016•69 citations