Abstract
In an interactive proof system, a prover called Paula knows some fact and tries to convince a verifier Victor of its truth. This might be some property of a secret key, say, that its least bit is 0.
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
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
von zur Gathen, J. (2015). Chapter 12 Proof systems and zero knowledge. In: CryptoSchool. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48425-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-48425-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48423-4
Online ISBN: 978-3-662-48425-8
eBook Packages: Computer ScienceComputer Science (R0)