Abstract
What are the resources of a zero-knowledge Proof? Interaction, communication, and en- velops. That interaction, that is the number of rounds of a protocol, is a resource is clear. Actually, it is not a very available one: having someone on the line to answer your questions all the time is quite a luxury. Thus, minimizing the number of rounds in zero-knowledge proofs will make these proofs much more attractive from a practical standpoint. That communication, that is the number of bits exchanged in a protocol, is a resource is also immediately clear. Perhaps, what is less clear is why envelopes are a resource. Let us explain why this is the case.
MIT, partially supported by NSF 865727-CCR and ARO DALL03-86-K-017.
MIT, supported in part by NSF grant DCR-84-13577.
Boston University, supported in part by NSF grant DCR-86-07492.
Chapter PDF
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kilian, J., Micali, S., Ostrovsky, R. (1990). Minimum Resource Zero-Knowledge Proofs. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_47
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_47
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive