Welcome to the resource topic for 1997/002
Title:
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
Authors: Mihir Bellare, Markus Jakobsson, 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.
ePrint: https://eprint.iacr.org/1997/002
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .