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

DOI10.1007/978-3-642-19571-6_33zbMath1295.94159OpenAlexW2950037325MaRDI QIDQ3000563

David Xiao

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_33

zbMATH Keywords

zero knowledgeparallel compositioncommitmentsconcurrent compositionselective opening attacksblack-box lower bounds

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Round-Optimal Black-Box Two-Party Computation ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Individual simulations

This page was built for publication: (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks