Revisiting lower and upper bounds for selective decommitments

DOI10.1007/978-3-642-36594-2_31MaRDI QIDQ4910298zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti

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_31

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

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

Cited in

(9)

• Individual simulations
• Concurrent non-malleable commitments (and more) in 3 rounds
• (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Public-key encryption with simulation-based selective-opening security and compact ciphertexts
• Round-optimal black-box two-party computation
• Possibility and impossibility results for selective decommitments
• Errata to: (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• Succinct arguments for RAM programs via projection codes

This page was built for publication: Revisiting lower and upper bounds for selective decommitments

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