Paper 2006/436

Statistically-Hiding Commitment from Any One-Way Function

Iftach Haitner and 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)
PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
one-way functionsstatistically-hiding commitmenttwo-phase commitmentuniversal one-way hash functions
Contact author(s)
iftach haitner @ weizmann ac il
History
2006-11-21: received
Short URL
https://ia.cr/2006/436
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2006/436}},
      url = {https://eprint.iacr.org/2006/436}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.