Expand description
Pedersen VSS — verifiable secret sharing with hiding commitments.
Structs§
- Pedersen
Commitment - Pedersen VSS commitment: (C_i, D_i) = (g^{a_i} * h^{r_i}, h^{r_i}).
- Pedersen
Params - Second generator h = g^alpha for some unknown alpha.
- Pedersen
Share - A Pedersen share: (x, y, y_r) where y = f(x), y_r = r(x).
The secret
valueandrandomnessfields are zeroized on drop.
Functions§
- deal
- Deal a secret using Pedersen VSS. Returns (commitments, shares) for T-of-N.
- joint_
public_ key - Extract the joint public key (C_0 without randomness hiding).
- verify_
share - Verify a Pedersen share against commitments. Checks: g^{f(j)} * h^{r(j)} == product(C_i^{j^i}).