Skip to content

Home > Cryptographic Primitives > Proof-Systems-for-DL

Proof Systems for General Statements about Discrete Logarithms

Paper: Proof Systems for General Statements about Discrete Logarithms

Description

Establishes a general framework and notation for constructing zero-knowledge proofs for arbitrary statements about discrete logarithms via Sigma-protocol composition. Enables proving relations among discrete logarithms such as equality of exponents across groups.

Properties

  • Completeness: Yes
  • Soundness: Computational (under DL assumption)
  • Zero-knowledge: HVZK; made non-interactive via Fiat-Shamir

Based on

Sigma-Protocols-Damgard, Pedersen-Commitments

Used by

Docknetwork, ZKAttest

Resources