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

The Exact Round Complexity of Secure Computation

Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou

Published Jan 1, 2016• 72 citations
Publisher
DOI
10.1007/978-3-662-49896-5_16

Related papers

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

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

On the Exact Round Complexity of Secure Three-Party Computation

Arpita Patra, Divya Ravi

Journal of Cryptology•Aug 18, 2021•2 citations

The Round Complexity of Secure Computation Against Covert Adversaries

Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain

Lecture notes in computer science•Jan 1, 2020•0 citations

On the Round Complexity of Secure Quantum Computation

James Bartusek, Andrea Coladangelo, Dakshita Khurana +1 more

Lecture notes in computer science•Jan 1, 2021•28 citations

On the Round Complexity Landscape of Secure Multi-party Computation

Divya Ravi

•Jan 18, 2021•0 citations

The Round Complexity of Black-Box Post-quantum Secure Computation

Rohit Chatterjee, Xiao Rong Liang, Omkant Pandey +1 more

arXiv:2502.13830•Lecture notes in computer science•Jan 1, 2025•3 citations