Lecture notes in computer science

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

Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan

Published Jan 1, 2018• 15 citations

Related papers

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

Susumu Kiyoshima

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

David Xiao

Round-Optimal Black-Box Two-Party Computation

Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro

Bounds on the Efficiency of “Black-Box” Commitment Schemes

Omer Horvitz, Jonathan I. Katz

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Round-Optimal Black-Box Protocol Compilers

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more