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

DOI10.1007/978-3-642-19571-6_33MaRDI QIDQ3000563zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Revisiting lower and upper bounds for selective decommitments
• Possibility and impossibility results for selective decommitments
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Standard security does not imply security against selective-opening

Cited in

(10)

• Round optimal black-box ``commit-and-prove
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Bounds on the efficiency of black-box commitment schemes
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Possibility and impossibility results for selective decommitments
• Individual simulations
• Round-optimal black-box two-party computation
• Revisiting lower and upper bounds for selective decommitments
• Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

This page was built for publication: (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 Q3000563)