Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

DOI10.1007/978-3-642-36594-2_40MaRDI QIDQ4910307zbMATH OpenOpenAlexFDO

Authors David Xiao

Publication date 18 March 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_40

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Revisiting lower and upper bounds for selective decommitments
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Possibility and impossibility results for selective decommitments

Cited in

(3)

• Individual simulations
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Knowledge encryption and its applications to simulatable protocols with low round-complexity

This page was built for publication: Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910307)