Discrete Logarithm¶
Description¶
Tags entries relying on the discrete logarithm assumption — the hardness assumption behind Pedersen commitments, Schnorr proofs, and many elliptic-curve-based ZKPs.
Canonical entry¶
→ CryptographicPrimitives/Proof-Systems-for-DL
Entries tagged¶
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018)
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991)
- Proof Systems for General Statements about Discrete Logarithms
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999)