Statistically-Hiding Commitment from Any One-Way Function

Iftach Haitner; Omer Reingold

Paper 2006/436 Original: eprint.iacr.org/2006/436 ↗

Statistically-Hiding Commitment from Any One-Way Function

Iftach Haitner

Omer Reingold

Abstract

We give a construction of statistically-hiding commitment schemes (ones where the hiding property holds information theoretically), based on the minimal cryptographic assumption that one-way functions exist. Our construction employs two-phase commitment schemes, recently constructed by Nguyen, Ong and Vadhan (FOCS `06), and universal one-way hash functions introduced and constructed by Naor and Yung (STOC `89) and Rompel (STOC `90).

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
History: 2006-11-21: last updated; 2006-11-21: published
Short URL: https://ia.cr/2006/436
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2006/436,
      author = {Iftach Haitner and Omer Reingold},
      title = {Statistically-Hiding Commitment from Any One-Way Function},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/436},
      year = {2006},
      url = {https://eprint.iacr.org/2006/436}
}