Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Two Attacks on Reduced IDEA Read chapter Read first chapter

1997 | OriginalPaper | Chapter

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

Authors : Mihir Bellare, Markus Jakobsson, Moti Yung

Published in: Advances in Cryptology — EUROCRYPT ’97

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

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.

previous chapter Stronger Security Proofs for RSA and Rabin Bits
next chapter Efficient Cryptographic Protocols Based on Noisy Channels
Metadata
Title
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
Authors
Mihir Bellare
Markus Jakobsson
Moti Yung
Copyright Year
1997
Publisher
Springer Berlin Heidelberg
Book
Advances in Cryptology — EUROCRYPT ’97

Print ISBN: 978-3-540-62975-7

Electronic ISBN: 978-3-540-69053-5

Copyright Year: 1997

DOI
https://doi.org/10.1007/3-540-69053-0_20

Premium Partner

    Image Credits