Struct schnorr::feldman_vss::VerifiableSS

pub struct VerifiableSS {
    pub parameters: ShamirSecretSharing,
    pub commitments: Vec<RistrettoPoint>,
}

Feldman VSS, based on Paul Feldman. 1987. A practical scheme for non-interactive verifiable secret sharing. In Foundations of Computer Science, 1987., 28th Annual Symposium on.IEEE, 427–43

implementation details: The code is using FE and GE. Each party is given an index from 1,..,n and a secret share of type FE. The index of the party is also the point on the polynomial where we treat this number as u32 but converting it to FE internally.

Fields

parameters: ShamirSecretSharing

commitments: Vec<RistrettoPoint>

Methods

impl VerifiableSS

pub fn reconstruct_limit(&self) -> usize

pub fn share(t: usize, n: usize, secret: &Scalar) -> (VerifiableSS, Vec<Scalar>)

generate VerifiableSS from a secret

pub fn share_at_indices(
    t: usize,
    n: usize,
    secret: &Scalar,
    index_vec: &[usize]
) -> (VerifiableSS, Vec<Scalar>)

generate VerifiableSS from a secret and user defined x values (in case user wants to distribute point f(1), f(4), f(6) and not f(1),f(2),f(3))

pub fn sample_polynomial(t: usize, coef0: &Scalar) -> Vec<Scalar>

pub fn evaluate_polynomial(
    coefficients: &[Scalar],
    index_vec: &[usize]
) -> Vec<Scalar>

pub fn mod_evaluate_polynomial(coefficients: &[Scalar], point: Scalar) -> Scalar

pub fn reconstruct(&self, indices: &[usize], shares: &[Scalar]) -> Scalar

pub fn lagrange_interpolation_at_zero(
    points: &[Scalar],
    values: &[Scalar]
) -> Scalar

Performs a Lagrange interpolation in field Zp at the origin for a polynomial defined by points and values. points and values are expected to be two arrays of the same size, containing respectively the evaluation points (x) and the value of the polynomial at those point (p(x)). The result is the value of the polynomial at x=0. It is also its zero-degree coefficient. This is obviously less general than newton_interpolation_general as we only get a single value, but it is much faster.

pub fn validate_share(
    &self,
    secret_share: &Scalar,
    index: usize
) -> Result<(), SchnorrError>

pub fn validate_share_public(
    &self,
    ss_point: &RistrettoPoint,
    index: usize
) -> Result<(), SchnorrError>

pub fn get_point_commitment(&self, index: usize) -> RistrettoPoint

pub fn map_share_to_new_params(&self, index: usize, s: &[usize]) -> Scalar

Trait Implementations

impl Clone for VerifiableSS

fn clone(&self) -> VerifiableSS

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl PartialEq<VerifiableSS> for VerifiableSS

fn eq(&self, other: &VerifiableSS) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &VerifiableSS) -> bool

This method tests for !=.

impl Debug for VerifiableSS

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl StructuralPartialEq for VerifiableSS

impl<'de> Deserialize<'de> for VerifiableSS

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Serialize for VerifiableSS

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.