Paper 2019/977
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zhenbin Yan and Yi Deng
Abstract
Round complexity is one of the fundamental problems in zero-knowledge proof systems. Non-malleable 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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. The Computer Journal
- DOI
- 10.1093/comjnl/bxaa076
- Keywords
- Zero-KnowledgeNon-MalleableMulti-Collision ResistanceComputational Complexity
- Contact author(s)
- yanzhenbin @ iie ac cn
- History
- 2020-07-12: last of 4 revisions
- 2019-08-29: received
- See all versions
- Short URL
- https://ia.cr/2019/977
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/977,
author = {Zhenbin Yan and Yi Deng},
title = {Non-malleable Zero-Knowledge Arguments with Lower Round Complexity},
howpublished = {Cryptology ePrint Archive, Paper 2019/977},
year = {2019},
doi = {10.1093/comjnl/bxaa076},
note = {\url{https://eprint.iacr.org/2019/977}},
url = {https://eprint.iacr.org/2019/977}
}
