Paper 2009/513
On the round complexity of black-box constructions of commitments secure against selective opening attacks
David Xiao
Abstract
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret.
We prove the following black-box constructions and black-box lower bounds for commitments secure against selective opening attacks for parallel composition:
1.
Note: Ostrovsky et al. (ePrint report 2011/536) discovered several errors in the original manuscript. This revision takes into account these errors.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. TCC 2011
- Keywords
- selective opening attacks
- Contact author(s)
- dxiao @ liafa univ-paris-diderot fr
- History
- 2012-05-29: last of 6 revisions
- 2009-10-26: received
- See all versions
- Short URL
- https://ia.cr/2009/513
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/513, author = {David Xiao}, title = {On the round complexity of black-box constructions of commitments secure against selective opening attacks}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/513}, year = {2009}, url = {https://eprint.iacr.org/2009/513} }