Concurrent non-malleable statistically hiding commitment

Zongyang Zhang; Zhenfu Cao

doi:10.1016/j.ipl.2012.03.003

Concurrent non-malleable statistically hiding commitment

Zongyang Zhang, Zhenfu Cao

Shanghai Jiao Tong University

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of NP. Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.

Original language	English
Pages (from-to)	443-448
Number of pages	6
Journal	Information Processing Letters
Volume	112
Issue number	11
DOIs	https://doi.org/10.1016/j.ipl.2012.03.003
State	Published - 15 Jun 2012
Externally published	Yes

Keywords

Concurrent non-malleability with respect to opening
Concurrent non-malleable zero-knowledge
Cryptography
Statistically hiding commitment

Access to Document

10.1016/j.ipl.2012.03.003

Cite this

@article{8925824a711e4040b0ef1416697db9f2,

title = "Concurrent non-malleable statistically hiding commitment",

abstract = "We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of NP. Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.",

keywords = "Concurrent non-malleability with respect to opening, Concurrent non-malleable zero-knowledge, Cryptography, Statistically hiding commitment",

author = "Zongyang Zhang and Zhenfu Cao",

year = "2012",

month = jun,

day = "15",

doi = "10.1016/j.ipl.2012.03.003",

language = "英语",

volume = "112",

pages = "443--448",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - Concurrent non-malleable statistically hiding commitment

AU - Zhang, Zongyang

AU - Cao, Zhenfu

PY - 2012/6/15

Y1 - 2012/6/15

N2 - We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of NP. Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.

AB - We present a modular construction of non-malleable statistically hiding commitment schemes that retains its properties when concurrently executed a polynomial number of times. Our protocol is based on a statistically hiding commitment scheme and a concurrent non-malleable zero-knowledge protocol for all of NP. Our result is achieved in the plain model without relying on any set-up assumptions. The proof of security only uses black-box techniques.

KW - Concurrent non-malleability with respect to opening

KW - Concurrent non-malleable zero-knowledge

KW - Cryptography

KW - Statistically hiding commitment

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

U2 - 10.1016/j.ipl.2012.03.003

DO - 10.1016/j.ipl.2012.03.003

M3 - 文章

AN - SCOPUS:84862792339

SN - 0020-0190

VL - 112

SP - 443

EP - 448

JO - Information Processing Letters

JF - Information Processing Letters

IS - 11

ER -

Concurrent non-malleable statistically hiding commitment

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this