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

Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments

David Xiao

Published Jan 1, 2012• 3 citations
Publisher
DOI
10.1007/978-3-642-31410-0_24

Related papers

Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks

David Xiao

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

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

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

Round-Optimal Black-Box Commit-and-Prove with Succinct Communication

Susumu Kiyoshima

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

Round Optimal Black-Box “Commit-and-Prove”

Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2018•15 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•1 citation

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

Lecture notes in computer science•Jan 1, 2015•38 citations