Abstract
Zero-knowledge (also called minimum disclosure) proof systems are indispensable wherever there is a necessity to prove the truth of a statment without revealing anything more about it. Zero-knowledge proofs involve two parties: the prover who claims that a statement is true, and the verifier who would like to be convinced that the statement is indeed true. The proof is conducted via an interaction between the parties. At the end of the protocol, the verifier is convinced only when the statement is true. If, however, the prover lies about the statement, the verifier will discover the lie with an overwhelming probability. The idea sprang out of interactive proof systems. Interactive proofs have gained a quite independent status as a part of computational complexity theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pieprzyk, J., Hardjono, T., Seberry, J. (2003). Zero-Knowledge Proof Systems. In: Fundamentals of Computer Security. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07324-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-07324-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07713-5
Online ISBN: 978-3-662-07324-7
eBook Packages: Springer Book Archive