Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity,The Computer Journal

当前位置： X-MOL 学术 › Comput. J. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity
The Computer Journal ( IF 1.5 ) Pub Date : 2020-07-09 , DOI: 10.1093/comjnl/bxaa076
Zhenbin Yan _{1,

2} , Yi Deng _{1,

2,

3}

Affiliation

Round complexity is one of the fundamental problems in zero-knowledge proof systems. Nonmalleable zero-knowledge (NMZK) protocols are zero-knowledge protocols that provide security even when man-in-the-middle adversaries interact with a prover and a verifier simultaneously. It is known that the first constant-round public-coin NMZK Arguments for NP can be constructed by assuming the existence of collision-resistant hash functions (Pass and Rosen STOC’05) and has relatively high round complexity; the first four-round private-coin NMZK Arguments for NP can be constructed in the plain model by assuming the existence of one-way functions (Goyal, Richelson, Rosen and Vald FOCS’14 and Ciampi, Ostrovsky, Siniscalchi and Visconti TCC’17). In this paper, we present a six-round public-coin NMZK argument of knowledge system assuming the existence of collision-resistant hash functions and a three-round private-coin NMZK argument system from multi-collision resistance of hash functions assumption in the keyless setting. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, China. School of Cyber Security, University of Chinese Academy of Sciences, China. Email: yanzhenbin@iie.ac.cn State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, China. School of Cyber Security, University of Chinese Academy of Sciences, China. Email: deng@iie.ac.cn

更新日期：2020-07-09

点击分享查看原文

点击收藏

阅读更多本刊最新论文