We show two constructions of statistically-hiding commitment schemes from regular one-way functions. Our first construction is more direct, and serves as a ``stepping-stone'' for our second construction which has improved round complexity. Of independent interest, as part of our work we show a compiler transforming any commitment scheme which is statistically-hiding against an honest-but-curious receiver to one which is statistically-hiding against a malicious receiver. This demonstrates the equivalence of these two formulations of the problem.
Our results also improve the complexity assumptions needed for statistical zero-knowledge arguments.Category / Keywords: foundations / Publication Info: Eurocrypt 2005 Date: received 3 Dec 2004, last revised 18 Mar 2005 Contact author: jkatz at cs umd edu Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Note: This is essentially the version submitted to Eurocrypt 2005. This work is superseded by what will appear in the Eurocrypt 2005 proceedings, but may be of interest as a simpler proof of a weaker result. Version: 20050318:193548 (All versions of this report) Discussion forum: Show discussion | Start new discussion