Share Verification
Share verification confirms that a distributed key share is consistent with the group's public key commitments, preventing malicious dealers from distributing unusable or compromised shares.
Key Takeaways
- Share verification lets each participant in a distributed key generation ceremony check that their key share is consistent with the group's public commitments, without revealing any secret material to other participants.
- The check relies on a commitment scheme published by the dealer: each participant evaluates the commitments at their own identifier and compares the result against their share. If the two match, the share is valid.
- Without share verification, a malicious dealer could distribute inconsistent shares that produce an unusable or compromised key, undermining the security of threshold signature schemes like FROST.
What Is Share Verification?
Share verification is the step in a verifiable secret sharing (VSS) protocol where each participant checks that the secret share they received is consistent with public information broadcast by the dealer. In the context of distributed key generation, the "dealer" is typically each participant in turn, and every other participant verifies the shares they receive from every dealer.
The core idea is straightforward: a dealer splits a secret into shares using a polynomial, then publishes commitments to that polynomial's coefficients. Each recipient can use those commitments to independently verify their share without learning anyone else's share or the underlying secret. If verification fails, the recipient knows the dealer sent an invalid share and can raise a complaint.
Share verification transforms basic Shamir's secret sharing into a verifiable scheme. Without it, participants must blindly trust the dealer. With it, honest participants can detect and reject malicious behavior during the key generation ceremony itself, before the key is ever used for signing.
How It Works
Share verification is most commonly implemented using Feldman's Verifiable Secret Sharing scheme (1987). The process has three phases: commitment publication, share distribution, and verification.
Commitment Publication
The dealer chooses a secret polynomial P(x) = a₀ + a₁x + a₂x² + ... + aₜxᵗ of degree t, where a₀ is the secret and t is the threshold minus one. The dealer then publishes commitments to each coefficient by computing:
C₀ = g^a₀
C₁ = g^a₁
C₂ = g^a₂
...
Cₜ = g^aₜHere g is a generator of the elliptic curve group (or a prime-order group in older formulations). These commitments are broadcast publicly. Because the discrete logarithm problem is hard, the commitments reveal nothing about the actual coefficient values to a computationally bounded observer.
Share Distribution
The dealer privately sends each participant i their share sᵢ = P(i): the polynomial evaluated at the participant's unique identifier. This share is sent over a secure channel so no other participant can see it.
The Verification Check
Each participant i verifies their share sᵢ using the public commitments. The check tests whether:
g^sᵢ =? C₀ · C₁^i · C₂^(i²) · ... · Cₜ^(iᵗ)
Equivalently:
g^sᵢ =? ∏(j=0 to t) Cⱼ^(iʲ)This works because the right side expands to:
g^a₀ · (g^a₁)^i · (g^a₂)^(i²) · ... · (g^aₜ)^(iᵗ)
= g^(a₀ + a₁·i + a₂·i² + ... + aₜ·iᵗ)
= g^P(i)If the dealer distributed a correct share, then sᵢ = P(i) and both sides are equal. If the dealer sent an inconsistent share, the equality fails and the participant detects the fraud. The homomorphic property of exponentiation makes this possible: you can check a relationship between secret values by working entirely with their public commitments.
Complaints and Resolution
When a participant's verification check fails, they broadcast a complaint identifying the dealer. The protocol then follows a resolution process:
- The complaining participant publishes their received share along with proof of what they were sent
- Other participants verify the complaint against the dealer's published commitments
- If the complaint is valid, the dealer is disqualified from the ceremony
- If enough dealers remain above the threshold, the DKG continues with the disqualified dealer's contributions excluded
In a Full DKG
In a DKG ceremony, there is no single dealer. Instead, every participant acts as a dealer for their own random polynomial. Each participant publishes their own commitments, distributes shares to every other participant, and verifies the shares they receive from all other participants. The final key share for each participant is the sum of all valid shares they received.
Feldman vs. Pedersen VSS
Two major variants of verifiable secret sharing exist, each with different security properties:
| Property | Feldman VSS | Pedersen VSS |
|---|---|---|
| Hiding | Computationally hiding (leaks g^s) | Perfectly hiding (information-theoretic) |
| Binding | Perfectly binding | Computationally binding |
| Commitments per coefficient | 1 group element | 1 group element (uses two generators) |
| Performance | Faster (fewer exponentiations) | Roughly 2x the cost |
| Use case | High-entropy secrets, FROST DKG | When hiding the secret is critical |
Feldman VSS publishes C₀ = g^s, which reveals the public key corresponding to the secret. For threshold signature schemes, this is acceptable because the group public key is meant to be public anyway. Pedersen VSS uses a second generator h and commits to each coefficient with two bases, achieving perfect hiding at the cost of additional computation.
The FROST threshold signature scheme uses Feldman-style verification in its key generation phase, as specified in RFC 9591 Appendix C. This is the natural choice because FROST signing requires the group public key to be known.
Use Cases
Threshold Signature Key Generation
The primary use case for share verification is during the setup of threshold signature schemes. In protocols like FROST, participants must generate key shares that are consistent with a single group public key. Share verification ensures every participant holds a valid share of the same polynomial, so that any t+1 participants can later cooperate to produce a valid Schnorr signature.
Platforms like Spark use threshold signing to enable cooperative signing over Bitcoin UTXOs. Share verification during DKG ensures that each signing party holds a share that will produce valid signing shares when the time comes to authorize a transaction.
Distributed Randomness Beacons
Protocols like drand use Pedersen DKG (which runs multiple Feldman VSS instances in parallel) to generate threshold key shares among a distributed set of nodes. Share verification ensures no node can bias the resulting randomness by contributing inconsistent shares.
Multi-Party Computation
In multi-party computation protocols, share verification is a building block for ensuring input consistency. When parties secret-share their inputs to a computation, verification prevents a malicious party from providing different values to different participants.
Key Rotation and Resharing
When a threshold group needs to rotate keys or change the set of participants, the existing shareholders run a resharing protocol. Share verification during resharing ensures the new shares are consistent with the original group public key, even though the underlying polynomial has changed.
Why It Matters
Share verification is a critical security property, not an optional optimization. Without it, several attacks become possible:
- A malicious dealer can send inconsistent shares, causing the resulting key to be unusable: when signers later try to combine their signing shares, the aggregated signature is invalid
- A malicious dealer can selectively send invalid shares to specific participants, excluding them from future signing operations and effectively reducing the threshold
- In schemes without verification, a dealer could distribute shares of a secret they already know, undermining the assumption that the key is distributed and no single party can sign alone
For Bitcoin applications, where threshold signatures protect real value, share verification during the key ceremony provides assurance that the resulting multisig setup will function correctly and that no participant has been given a poisoned share.
Risks and Considerations
Computational Cost
Each verification check requires multiple elliptic curve scalar multiplications: one for each commitment in the polynomial. In a DKG with n participants and threshold t, each participant must verify n-1 shares, performing t+1 multiplications per check. For large groups, this can become a bottleneck. Techniques like batch verification can amortize some of this cost.
Information Leakage in Feldman VSS
Feldman's scheme publishes g^s as part of the commitment vector. While this does not reveal the secret s (recovering it would require solving the discrete logarithm), it does reveal the corresponding public key. For threshold signature setups, this is typically the desired behavior. For applications requiring secrecy of the shared value itself, Pedersen VSS provides stronger hiding guarantees.
Communication Overhead
Share verification adds communication requirements to the DKG protocol. Each dealer must broadcast t+1 group elements (the commitment vector), and the complaint resolution process requires additional rounds of communication if any share fails verification. In asynchronous networks, coordinating these rounds introduces latency.
Rogue Key Attacks
In some DKG constructions, a malicious participant can choose their polynomial coefficients after seeing other participants' commitments, biasing the resulting group key. Proof-of-possession and other mitigations address this, but they are distinct from share verification itself. Share verification ensures consistency; additional mechanisms are needed to ensure fairness.
This glossary entry is for informational purposes only and does not constitute financial or investment advice. Always do your own research before using any protocol or technology.