Home > Cryptographic Primitives > Sigma-Protocols-Damgard
On Σ-protocols¶
Description¶
A Σ-protocol is a three-move interactive proof: commit, challenge, response. Fundamental building blocks for zero-knowledge proofs about discrete logarithms and related algebraic problems. Can be made non-interactive via Fiat-Shamir.
Properties¶
- Completeness: Yes
- Soundness: Special soundness (2-extractability of witness)
- Zero-knowledge: Special honest-verifier zero-knowledge (HVZK)
Based on¶
Discrete logarithm / algebraic group settings
Used by¶
Pedersen-Commitments, Proof-Systems-for-DL, ZKAttest, Camenisch-Michels-Safe-Primes, Sigma-Protocols-Proposal
Resources¶
- Paper: Dam04-Sigma-Protocols
- Explainer: