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 Commit-and-Prove with Succinct Communication

Susumu Kiyoshima

Published Jan 1, 2020• 6 citations
Publisher
DOI
10.1007/978-3-030-56880-1_19

Related papers

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

Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan

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

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

David Xiao

Lecture notes in computer science•Jan 1, 2012•3 citations

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

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

Black-Box Constant-Round Secure 2PC with Succinct Communication

Michele Ciampi, Ankit Kumar Misra, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2025•4 citations

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2025•2 citations

Round-Optimal Black-Box Protocol Compilers

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

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