ETH Zürich » Computer Science » Theory » Cryptography

Zero Knowledge Proofs

A protocol between two parties Alice and Bob is zero-knowledge (from Alice's point of view), if it does not leak any information to Bob. Zero-knowledge is a fundamental notion in cryptography and has important applications. For example, Alice can prove to Bob that she knows a secret key corresponding to a given public key (e.g., for identifying herself to Bob) without leaking any information whatsoever about the secret key.


Research Highlights

  • Group signature scheme. In [CS97] the first efficient group signature scheme for large groups was proposed. A group signature scheme allows members of a group (e.g. a company) to sign anonymously on behalf of the group. In case of dispute a special authority can determine the identity of the signer.

Publications Concerning This Topic

Ueli Maurer
Unifying Zero-knowledge Proofs of Knowledge
Advances in Cryptology - AfricaCrypt 2009, Lecture Notes in Computer Science, Springer-Verlag, Jun 2009.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer, Krzysztof Pietrzak, and Renato Renner
Indistinguishability Amplification
Dec 2006, Available at http://eprint.iacr.org/2006/456.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, pp. 478–493, Aug 2005.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Marc Fischlin
Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 152–168, Aug 2005.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Giuseppe Persiano, and Ivan Visconti
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 135-151, Aug 2005.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, and Phillip MacKenzie
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1751, pp. 354–372, Jan 2000.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
Zero-Knowledge for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 424–441, Aug 1998.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
Linear Zero-Knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments
Proc. 29th ACM Symposium on Theory of Computing — STOC '97, ACM, pp. 436–445, May 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 75–87, May 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch and Markus Stadler
Proof Systems for General Statements about Discrete Logarithms
Technical Report no. 260, Institute for Theoretical Computer Science, ETH Zurich, Mar 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE


Main Research Page