1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

#![cfg_attr(not(feature = "std"), no_std)]
#![allow(non_snake_case)]

//! Implements the following range proof and set-membership protocols.
//! 1. Set membership protocol using BB signature. Described in Fig.1 of the paper [1]. [Code](/src/ccs_set_membership)
//! 2. Range proof protocol as described in Fig.3 of the paper [1]. Considers a perfect-range, i.e. range of the form `[0, u^l)`
//! where `u` is the base and the upper bound is a power of the base. [Code](src/ccs_range_proof/perfect_range.rs)
//! 3. Range proof protocol as described in section 4.4 of the paper [1]. Considers an arbitrary range `[min, max)`. Some
//! differences with the paper, check the module for more details. [Code](src/ccs_range_proof/arbitrary_range.rs)
//! 4. Range proof using sumsets, based on Protocol 2 from the paper [2]. [Code](src/smc_range_proof.rs)
//! 5. Implements the Keyed-Verification of the above protocols where the verifier knows the secret key of the BB sig. This makes
//! the proof generation and verification more efficient by removing the need for pairings. This idea is taken from this PhD. thesis.
//!
//! Above protocols use a pairing based signature called the weak-BB signature.
//!
//! UPDATE: Implements variations of above protocols which use an optimized version of proving knowledge of weak-BB
//! signature described in section 2.4 of the paper [3] which does not require the prover to do pairings which makes the
//! proofs much shorter and faster to verify. This paper will be called the CDH paper
//!
//! References:
//!
//! [1]: [Efficient Protocols for Set Membership and Range Proofs](https://link.springer.com/chapter/10.1007/978-3-540-89255-7_15)
//!
//! [2]: [Additive Combinatorics and Discrete Logarithm Based Range Protocols](https://eprint.iacr.org/2009/469)
//!
//! [3]: [Scalable Revocation Scheme for Anonymous Credentials Based on n-times Unlinkable Proofs](http://library.usc.edu.ph/ACM/SIGSAC%202017/wpes/p123.pdf)

#[macro_use]
pub mod common;
pub mod ccs_range_proof;
pub mod ccs_set_membership;
mod cls_range_proof;
pub mod error;

pub mod prelude {
    pub use crate::{
        ccs_range_proof::{
            CCSArbitraryRangeProof, CCSArbitraryRangeProofProtocol,
            CCSArbitraryRangeProofWithKVProtocol, CCSArbitraryRangeWithKVProof,
        },
        ccs_set_membership::setup::{
            SetMembershipCheckParams, SetMembershipCheckParamsWithPairing,
        },
        cls_range_proof::{
            CLSRangeProof, CLSRangeProofProtocol, CLSRangeProofWithKV, CLSRangeProofWithKVProtocol,
        },
        common::{
            MemberCommitmentKey, PublicKeyG2, SecretKey, SignatureG1, SignatureParams,
            SignatureParamsWithPairing,
        },
        error::SmcRangeProofError,
    };
}