Skip to content

Home > Resources > papers > Ped91-Commitments

Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991)

URL: https://link.springer.com/content/pdf/10.1007/3-540-46766-1_9.pdf

Summary

Introduces Pedersen commitments — a perfectly hiding, computationally binding commitment scheme based on the discrete logarithm problem. Pedersen commitments are a fundamental primitive used in Bulletproofs, Sigma protocols, range proofs, and many modern ZKP systems.

Used by