Statistically-hiding commitment from any one-way function

Iftach Haitner; Omer Reingold

doi:10.1145/1250790.1250792

Statistically-hiding commitment from any one-way function

Iftach Haitner^*, Omer Reingold

^*Corresponding author for this work

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

50 Scopus citations

Abstract

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

Original language	English
Title of host publication	STOC'07
Subtitle of host publication	Proceedings of the 39th Annual ACM Symposium on Theory of Computing
Pages	1-10
Number of pages	10
DOIs	https://doi.org/10.1145/1250790.1250792
State	Published - 2007
Externally published	Yes
Event	STOC'07: 39th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States Duration: 11 Jun 2007 → 13 Jun 2007

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	STOC'07: 39th Annual ACM Symposium on Theory of Computing
Country/Territory	United States
City	San Diego, CA
Period	11/06/07 → 13/06/07

Keywords

Cryptography
One-way functions
Statistically hiding and computationally binding commitment

Access to Document

10.1145/1250790.1250792

Cite this

@inproceedings{9e644e2b26a245429cebbecbd36d6089,

title = "Statistically-hiding commitment from any one-way function",

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

keywords = "Cryptography, One-way functions, Statistically hiding and computationally binding commitment",

author = "Iftach Haitner and Omer Reingold",

year = "2007",

doi = "10.1145/1250790.1250792",

language = "אנגלית",

isbn = "1595936319",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "1--10",

booktitle = "STOC'07",

note = "STOC'07: 39th Annual ACM Symposium on Theory of Computing ; Conference date: 11-06-2007 Through 13-06-2007",

}

Haitner, I & Reingold, O 2007, Statistically-hiding commitment from any one-way function. in STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1-10, STOC'07: 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, United States, 11/06/07. https://doi.org/10.1145/1250790.1250792

TY - GEN

T1 - Statistically-hiding commitment from any one-way function

AU - Haitner, Iftach

AU - Reingold, Omer

PY - 2007

Y1 - 2007

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

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

KW - Cryptography

KW - One-way functions

KW - Statistically hiding and computationally binding commitment

UR - http://www.scopus.com/inward/record.url?scp=35448982726&partnerID=8YFLogxK

U2 - 10.1145/1250790.1250792

DO - 10.1145/1250790.1250792

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:35448982726

SN - 1595936319

SN - 9781595936318

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 1

EP - 10

BT - STOC'07

T2 - STOC'07: 39th Annual ACM Symposium on Theory of Computing

Y2 - 11 June 2007 through 13 June 2007

ER -

Statistically-hiding commitment from any one-way function

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this