Module smc_range_proof::ccs_range_proof
source · Expand description
Range proof protocols as described in Fig.3 and section 4.4 of Efficient Protocols for Set Membership and Range Proofs
Re-exports§
pub use arbitrary_range_cdh::CCSArbitraryRangeProof;
pub use arbitrary_range_cdh::CCSArbitraryRangeProofProtocol;
pub use kv_arbitrary_range::CCSArbitraryRangeProofWithKVProtocol;
pub use kv_arbitrary_range::CCSArbitraryRangeWithKVProof;
Modules§
- Range proof protocol as described in section 4.4 of the paper Efficient Protocols for Set Membership and Range Proofs. Considers an arbitrary range
[min, max)
. This essentially executes 2 instances of the protocol for perfect range[0, u^l)
A difference with the paper is that a singleD
is created in the paper which can lead to the verifier learning that some digits are same in values in those 2 protocols - Range proof protocol based on section 4.4 of the paper Efficient Protocols for Set Membership and Range Proofs. Considers an arbitrary range
[min, max)
The difference with the paper is the protocol used to prove knowledge of weak-BB sig which is taken from the CDH paper. - Same as CCS arbitrary range proof protocol but does Keyed-Verification, i.e. the verifies knows the secret key of the BB-sig
- Same as CCS perfect range proof protocol but does Keyed-Verification, i.e. the verifies knows the secret key of the BB-sig
- Range proof protocol as described in Fig.3 of the paper Efficient Protocols for Set Membership and Range Proofs. Considers a perfect-range, i.e. range of the form
[0, u^l)
whereu
is the base and the upper bound is a power of the base. The calculations are changed a bit to be consistent with other instances of Schnorr protocol in this project. - Range proof protocol based on Fig.3 of the paper Efficient Protocols for Set Membership and Range Proofs. Considers a perfect-range, i.e. range of the form
[0, u^l)
whereu
is the base and the upper bound is a power of the base. The difference with the paper is the protocol used to prove knowledge of weak-BB sig which is taken from the CDH paper.