Non-malleable statistically hiding commitment from any one-way function

Zongyang Zhang; Zhenfu Cao; Ning Ding; Rong Ma

doi:10.1007/978-3-642-10366-7_18

Non-malleable statistically hiding commitment from any one-way function

Zongyang Zhang^*
, Zhenfu Cao
, Ning Ding
, Rong Ma

^*Corresponding author for this work

Shanghai Jiao Tong University

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

11 Scopus citations

Abstract

We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.

Original language	English
Title of host publication	Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Pages	303-318
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-10366-7_18
State	Published - 2009
Externally published	Yes
Event	15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009 - Tokyo, Japan Duration: 6 Dec 2009 → 10 Dec 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5912 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009
Country/Territory	Japan
City	Tokyo
Period	6/12/09 → 10/12/09

Access to Document

10.1007/978-3-642-10366-7_18

Cite this

Zhang, Z., Cao, Z., Ding, N., & Ma, R. (2009). Non-malleable statistically hiding commitment from any one-way function. In Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 303-318). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5912 LNCS). https://doi.org/10.1007/978-3-642-10366-7_18

Zhang, Zongyang ; Cao, Zhenfu ; Ding, Ning et al. / Non-malleable statistically hiding commitment from any one-way function. Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. 2009. pp. 303-318 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6e4a731c2643477fa018fd718a42ef1d,

title = "Non-malleable statistically hiding commitment from any one-way function",

abstract = "We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.",

author = "Zongyang Zhang and Zhenfu Cao and Ning Ding and Rong Ma",

year = "2009",

doi = "10.1007/978-3-642-10366-7\_18",

language = "英语",

isbn = "3642103650",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "303--318",

booktitle = "Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

note = "15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009 ; Conference date: 06-12-2009 Through 10-12-2009",

}

Zhang, Z, Cao, Z, Ding, N & Ma, R 2009, Non-malleable statistically hiding commitment from any one-way function. in Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5912 LNCS, pp. 303-318, 15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009, Tokyo, Japan, 6/12/09. https://doi.org/10.1007/978-3-642-10366-7_18

Non-malleable statistically hiding commitment from any one-way function. / Zhang, Zongyang; Cao, Zhenfu; Ding, Ning et al.
Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. 2009. p. 303-318 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5912 LNCS).

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

TY - GEN

T1 - Non-malleable statistically hiding commitment from any one-way function

AU - Zhang, Zongyang

AU - Cao, Zhenfu

AU - Ding, Ning

AU - Ma, Rong

PY - 2009

Y1 - 2009

N2 - We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.

AB - We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.

UR - https://www.scopus.com/pages/publications/72449160566

U2 - 10.1007/978-3-642-10366-7_18

DO - 10.1007/978-3-642-10366-7_18

M3 - 会议稿件

AN - SCOPUS:72449160566

SN - 3642103650

SN - 9783642103650

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 303

EP - 318

BT - Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

T2 - 15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009

Y2 - 6 December 2009 through 10 December 2009

ER -

Zhang Z, Cao Z, Ding N, Ma R. Non-malleable statistically hiding commitment from any one-way function. In Advances in Cryptology - ASIACRYPT 2009 - 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. 2009. p. 303-318. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-10366-7_18

Non-malleable statistically hiding commitment from any one-way function

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this