Skip to main content

1997 | OriginalPaper | Buchkapitel

Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function

verfasst von : Mihir Bellare, Markus Jakobsson, Moti Yung

Erschienen in: Advances in Cryptology — EUROCRYPT ’97

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
verfasst von
Mihir Bellare
Markus Jakobsson
Moti Yung
Copyright-Jahr
1997
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-69053-0_20