Home > Resources > papers > CS97-DL-Proofs

Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997)

URL: https://crypto.ethz.ch/publications/files/CamSta97b.pdf

Summary

Introduces the Camenisch-Stadler notation for sigma protocols and gives efficient proof systems for general statements about discrete logarithms. Establishes the compositional proof framework (AND, OR, equality of discrete logs) widely used in anonymous credential and privacy-preserving protocol design.

Used by

• Proof-Systems-for-DL
• ZK-Proof-Taxonomy

Related resources

• On Sigma Protocols (Damgård) (paper, 2004)