Theory of Cryptography pp 721-722
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
Several proofs initially presented by the author  were shown to be incorrect in a recent work of Ostrovsky et al . In this notice we summarize the errors and summarize the current state of the art after taking into account the errors and subsequent work.
- 1.Ostrovsky, R., Rao, V., Scafuro, A., Visconti, I.: Revisiting Lower and Upper Bounds for Selective Decommitments. Cryptology ePrint Archive, Report 2011/536 (2011), http://eprint.iacr.org/
- 3.Xiao, D.: On the round complexity of black-box constructions of commitments secure against selective opening attacks. Technical Report 2009/513, Cryptology ePrint Archive (2012)Google Scholar