Abstract
A zero-knowledge proof is an interactive proof with the additional property that the verifier learns nothing beyond the correctness of the statement being proved. The theory of zero-knowledge proofs is beautiful and rich, and is a cornerstone of the foundations of cryptography. In the context of cryptographic protocols, zero-knowledge proofs can be used to enforce “good behavior” by having parties prove that they indeed followed the protocol correctly. These proofs must reveal nothing about the parties’ private inputs, and as such must be zero knowledge. Zero-knowledge proofs are often considered an expensive (and somewhat naive) way of enforcing honest behavior, and those who view them in this way consider them to be not very useful when constructing efficient protocols.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Har-Peled. Lecture Notes on Approximation Algorithms in Geometry, Chapter 27, Excercise 27.5.3, 2010. Currently found at http://valis.cs.uiuc.edu/∼sariel/teach/notes/aprx/. 258 References
R. Cramer and I. Damgård. On the Amortized Complexity of Zero- Knowledge Protocols. In CRYPTO’09. Springer-Verlag (LNCS 5677), pages 177–191, 2009.
U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416–426, 1990.
I. Damgård. On Σ Protocols. http://www.daimi.au.dk/∼ivan/Sigma.pdf.
M. Bellare and O. Goldreich. On Probabilistic Versus Deterministic Provers in the Definition of Proofs of Knowledge. Manuscript, 2006.
R. Cramer, I. Damgård and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In CRYPTO’94, Springer-Verlag (LNCS 839), pages 174–187, 1994.
O. Goldreich and A. Kahan. How to Construct Constant-Round Zero- Knowledge Proof Systems for NP. Journal of Cryptology, 9(3):167– 190, 1996.
M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO’92, Springer-Verlag (LNCS 740), pages 390–420, 1992.
O. Goldreich. Foundations of Cryptography: Volume 1 – Basic Tools. Cambridge University Press, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hazay, C., Lindell, Y. (2010). Sigma Protocols and Efficient Zero-Knowledge1 . In: Efficient Secure Two-Party Protocols. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14303-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14303-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14302-1
Online ISBN: 978-3-642-14303-8
eBook Packages: Computer ScienceComputer Science (R0)