Cryptology ePrint Archive: Report 1997/002
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
Mihir Bellare and Markus Jakobsson and Moti Yung
Abstract: We fill a gap in the theory of zero-knowledge protocols by presenting
NP-arguments that achieve negligible error probability and computational
zero-knowledge in four rounds of interaction, assuming only the existence of a
one-way function. This result is optimal in the sense that four rounds and a
one-way function are each individually necessary to achieve a negligible error
zero-knowledge argument for NP.
Category / Keywords: Zero-knowledge, one-way functions, arguments, round
Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Date: received February 26th, 1997.
Contact author: mihir at cs ucsd edu
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Short URL: ia.cr/1997/002
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]