International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function

Authors:
Mihir Bellare
Markus Jakobsson
Moti Yung
Download:
URL: http://eprint.iacr.org/1997/002
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-1997-11284,
  title={Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function},
  booktitle={IACR Eprint archive},
  keywords={Zero-knowledge, one-way functions, arguments, round},
  url={http://eprint.iacr.org/1997/002},
  note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. mihir@cs.ucsd.edu 10500 received February 26th, 1997.},
  author={Mihir Bellare and Markus Jakobsson and Moti Yung},
  year=1997
}