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

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	443-448
页数	6
期刊	Information Processing Letters
卷	112
期	11
DOI	https://doi.org/10.1016/j.ipl.2012.03.003
出版状态	已出版 - 15 6月 2012
已对外发布	是

访问文件

10.1016/j.ipl.2012.03.003

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{90d9a21de76748f986f38c332b946984,

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

摘要

访问文件

其它文件与链接

指纹

引用此