Module vsss_rs::pedersen

Pedersen’s Verifiable secret sharing scheme. (see https://www.cs.cornell.edu/courses/cs754/2001fa/129.PDF)

Pedersen returns both Pedersen verifiers and Feldman verifiers for the purpose that both may be needed for other protocols like Gennaro’s DKG. Otherwise, the Feldman verifiers may be discarded.

Structs

• StdPedersenResult
  The std result to use when an allocator is available

Traits

• Pedersen
  A secret sharing scheme that uses pedersen commitments as verifiers (see https://www.cs.cornell.edu/courses/cs754/2001fa/129.PDF)
• PedersenResult
  A result output from splitting a secret with Pedersen

Functions

• split_secret
  Create shares from a secret. [G::Scalar] is the prime field blinding is the blinding factor. If None, a random value is generated in [G::Scalar]. share_generator is the generator point to use for shares. If None, the default generator is used. blind_factor_generator is the generator point to use for blinding factor shares. If None, a random generator is used