Bulletproofs are short non-interactive zero-knowledge proofs that require no trusted setup
-
Updated
Dec 25, 2022 - Haskell
Bulletproofs are short non-interactive zero-knowledge proofs that require no trusted setup
This example generates a random secret key and ordinal value, creates a Pedersen commitment using secp256k1, generates a Bulletproof using secp256k1_bulletproofs, encodes the data as a hex string, adds it as an output to a Bitcoin transaction, and broadcasts it to the network. Note that this is a simplified example and should not be used without ad
Pedersen's Protocol - Demo
Go collection of zero knowledge proofs of equality using elliptic curve cryptography
A zero-knowledge and transparent proximity marketing platform using Hyperledger Fabric.
Add a description, image, and links to the pedersen-commitment topic page so that developers can more easily learn about it.
To associate your repository with the pedersen-commitment topic, visit your repo's landing page and select "manage topics."