We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. A special case is the class of regular one-way functions where all points in the image of the function have the same (known) number of pre-images. We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver.
|Number of pages||28|
|Journal||Journal of Cryptology|
|State||Published - Jul 2009|
Bibliographical noteFunding Information:
Research supported by US-Israel Binational Science Foundation grant 2002246.
Research supported by US-Israel Binational Science Foundation grant 2004329.
Research of O.H. supported by U.S. Army Research Office award DAAD19-01-1-0494. Research of J.K. supported by NSF CAREER award #0447075.
- Bit commitment
- Regular one way functions
- Statistical hiding
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics