Module one_of_many_proofs::proofs

Structs

BitProof	A bit commitment proof. This is used as part of a OneOfManyProof and not meant for use on its own. A zero knowledge proof that the prover knows the openings of commitments to a sequence of bits.
OneOfManyProof	A zero knowledge proof of membership in a set. A prover can convince a verifier that he knows the index of a commitment within a set of commitments, and the opening of that commitment, without revealing any information about the commitment or its location within the set.
ProofGens	A collection of generator points that can be used to compute various proofs in this module. To create an instance of ProofGens it is recommended to call ProofGens::new(n), where n is the number of bits to be used in proofs and verifications.

Traits

OneOfManyProofs

Trait for computing and verifying OneOfMany zero-knowledge membership proofs over a set of points. Each method is designed to iterate over a set of RistrettoPoints representing pedersen commitments. A prover should know the opening of one commitment in the set, and the index of that commitment within the set.