Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
cryptographic commitment scheme
|
| gptkbp:application |
digital cash
confidential transactions mix networks secure voting range proofs |
| gptkbp:assumes |
hardness of discrete logarithm
|
| gptkbp:basedOn |
discrete logarithm problem
|
| gptkbp:category |
public-key cryptography
commitment scheme |
| gptkbp:citation |
Pedersen, T. P. (1991). Non-interactive and information-theoretic secure verifiable secret sharing. CRYPTO 1991.
|
| gptkbp:commitmentValue |
C = g^m h^r mod p
|
| https://www.w3.org/2000/01/rdf-schema#label |
Pedersen commitment
|
| gptkbp:introducedIn |
1991
|
| gptkbp:inventedBy |
Torben Pryds Pedersen
|
| gptkbp:parameter |
prime p
generator g generator h message m random r |
| gptkbp:property |
binding
hiding homomorphic |
| gptkbp:usedIn |
gptkb:cryptocurrency
cryptography zero-knowledge proofs |
| gptkbp:bfsParent |
gptkb:Confidential_Transactions
|
| gptkbp:bfsLayer |
7
|