Expand description
Feldman verifiable secret sharing over P-256.
A dealer samples a degree-T-1 polynomial
f(x) = a_0 + a_1 x + ... + a_{T-1} x^{T-1} with a_0 = secret,
privately sends each party i the evaluation y_i = f(i), and
broadcasts Feldman commitments C_j = g^{a_j}. Recipients verify
g^{y_i} == \prod_j C_j^{i^j} without learning the coefficients.
C_0 = g^{secret} is the public key for the shared secret.
Structs§
- Feldman
Vss - One dealer’s Feldman VSS output.