Paper 1997/002 Original: eprint.iacr.org/1997/002 ↗
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 1997-02-26: last updated
- 1997-02-26: published
- Short URL
- https://ia.cr/1997/002
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:1997/002,
author = {Mihir Bellare and Markus Jakobsson and Moti Yung},
title = {Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function},
howpublished = {Cryptology {ePrint} Archive, Paper 1997/002},
year = {1997},
url = {https://eprint.iacr.org/1997/002}
}