Anoncoin  0.9.4
P2P Digital Currency
Public Member Functions | Public Attributes | List of all members
libzerocoin::AccumulatorAndProofParams Class Reference

#include <Params.h>

Collaboration diagram for libzerocoin::AccumulatorAndProofParams:
[legend]

Public Member Functions

 AccumulatorAndProofParams ()
 Construct a set of Zerocoin parameters from a modulus "N". More...
 

Public Attributes

bool initialized
 
Bignum accumulatorModulus
 Modulus used for the accumulator. More...
 
Bignum accumulatorBase
 The initial value for the accumulator A random Quadratic residue mod n thats not 1. More...
 
Bignum minCoinValue
 Lower bound on the value for committed coin. More...
 
Bignum maxCoinValue
 Upper bound on the value for a comitted coin. More...
 
IntegerGroupParams accumulatorPoKCommitmentGroup
 The second of two groups used to form a commitment to a coin (which it self is a commitment to a serial number). More...
 
IntegerGroupParams accumulatorQRNCommitmentGroup
 Hidden order quadratic residue group mod N. More...
 
uint32_t k_prime
 Security parameter. More...
 
uint32_t k_dprime
 Security parameter. More...
 

Detailed Description

Definition at line 105 of file Params.h.

Constructor & Destructor Documentation

libzerocoin::AccumulatorAndProofParams::AccumulatorAndProofParams ( )

Construct a set of Zerocoin parameters from a modulus "N".

Parameters
NA trusted RSA modulus
securityLevelA security level expressed in symmetric bits (default 80)

Allocates and derives a set of Zerocoin parameters from a trustworthy RSA modulus "N". This routine calculates all of the remaining parameters (group descriptions etc.) from N using a verifiable, deterministic procedure.

Note: this constructor makes the fundamental assumption that "N" encodes a valid RSA-style modulus of the form "e1 * e2" where "e1" and "e2" are safe primes. The factors "e1", "e2" MUST NOT be known to any party, or the security of Zerocoin is compromised. The integer "N" must be a MINIMUM of 1024 in length. 3072 bits is strongly recommended.

Definition at line 30 of file Params.cpp.

Member Data Documentation

Bignum libzerocoin::AccumulatorAndProofParams::accumulatorBase

The initial value for the accumulator A random Quadratic residue mod n thats not 1.

Definition at line 139 of file Params.h.

Bignum libzerocoin::AccumulatorAndProofParams::accumulatorModulus

Modulus used for the accumulator.

Product of two safe primes who's factorization is unknown.

Definition at line 133 of file Params.h.

IntegerGroupParams libzerocoin::AccumulatorAndProofParams::accumulatorPoKCommitmentGroup

The second of two groups used to form a commitment to a coin (which it self is a commitment to a serial number).

This one differs from serialNumberSokCommitment due to restrictions from Camenisch and Lysyanskaya's paper.

Definition at line 159 of file Params.h.

IntegerGroupParams libzerocoin::AccumulatorAndProofParams::accumulatorQRNCommitmentGroup

Hidden order quadratic residue group mod N.

Used in the accumulator proof.

Definition at line 165 of file Params.h.

bool libzerocoin::AccumulatorAndProofParams::initialized

Definition at line 127 of file Params.h.

uint32_t libzerocoin::AccumulatorAndProofParams::k_dprime

Security parameter.

The statistical zero-knowledgeness of the accumulator proof.

Definition at line 177 of file Params.h.

uint32_t libzerocoin::AccumulatorAndProofParams::k_prime

Security parameter.

Bit length of the challenges used in the accumulator proof.

Definition at line 171 of file Params.h.

Bignum libzerocoin::AccumulatorAndProofParams::maxCoinValue

Upper bound on the value for a comitted coin.

Required by the accumulator proof.

Definition at line 151 of file Params.h.

Bignum libzerocoin::AccumulatorAndProofParams::minCoinValue

Lower bound on the value for committed coin.

Required by the accumulator proof.

Definition at line 145 of file Params.h.


The documentation for this class was generated from the following files: