Publicly verifiable secret sharing explained

In cryptography, a secret sharing scheme is publicly verifiable (PVSS) if it is a verifiable secret sharing scheme and if any party (not just the participants of the protocol) can verify the validity of the shares distributed by the dealer.

The method introduced here according to the paper by Chunming Tang, Dingyi Pei, Zhuo Liu, and Yong He is non-interactive and maintains this property throughout the protocol.

Initiali

The PVSS scheme dictates an initialization process in which:

1. All system parameters are generated.
2. Each participant must have a registered public key.

Excluding the initialization process, the PVSS consists of two phases:

Distribution

1. Distribution of secret

s shares is performed by the dealer D , which does the following:

• The dealer creates

s _{1} ,s _{2} ...s _{n} for each participant P _{1} ,P _{2} ...P _{n} respectively.

• The dealer publishes the encrypted share

E _{i} (s _{i} ) for each P _{i} .

• The dealer also publishes a string

proof _{D} to show that each E _{i} encrypts s _{i} (note: proof _{D} guarantees that the reconstruction protocol will result in the same s .

2. Verification of the shares:

• Anybody knowing the public keys for the encryption methods

E _{i} , can verify the shares.

• If one or more verifications fails the dealer fails and the protocol is aborted.

Reconstruction

1. Decryption of the shares:

• The Participants

P _{i} decrypts their share of the secret s _{i} using E _{i} (s _{i} ) .(note: fault-tolerance can be allowed here: it's not required that all participants succeed in decrypting E _{i} (s _{i} ) as long as a qualified set of participants are successful to decrypt s _{i} ).

• The participant release

s _{i} plus a string proof _{P _{i}} this shows the released share is correct.

2. Pooling the shares:

• Using the strings

proof _{P _{i}} to exclude the participants which are dishonest or failed to decrypt E _{i} (s _{i} ) .

• Reconstruction

s can be done from the shares of any qualified set of participants.

Chaum-Pedersen Protocol

A proposed protocol proving:

log _{_{g1}} h _{1} = log _{_{g2}} h _{2} :

1. The prover chooses a random

r\in \boldsymbol{\Zeta} _{q ^{*}}

1. The verifier sends a random challenge

c \in _{R} \boldsymbol{\Zeta} _{q}

1. The prover responds with

s = r - c x( mod q)

1. The verifier checks

\alpha _{1} = g ^{s} _{1} h ^{c} _{1} and \alpha _{2} = g ^{s} _{2} h ^{c} _{2}

Denote this protocol as:

dleq (g _{1,} h _{1,g} _{2,h} _{2)}
A generalization of dleq (g _{1,} h _{1,g} _{2,h} _{2)} is denoted as: dleq (X, Y, g _{1,} h _{1,g} _{2,h} _{2)} where as: X = g ^{x _{1}} _{1} g ^{x _{2}} _{2} and Y = h ^{x _{1}} _{1} h ^{x _{2}} _{2} :

1. The prover chooses a random

r _{1,r} _{2} \in Z ^{*} _{q} and sends t _{1} = g ^{r _{1}} _{1} g ^{r _{2}} _{2} and t _{2} = h ^{r _{1}} _{1} h ^{r _{2}} _{2}

1. The verifier sends a random challenge

c \in _{R} \boldsymbol{\Zeta} _{q} .

1. The prover responds with

s _{1} = r _{1} - cx _{1} ( mod q) , s _{2} = r _{2} - cx _{2} ( mod q) .

1. The verifier checks

t _{1} = X ^{c} g ^{s _{1}} _{1} g ^{s _{2}} _{2} and t _{2} = Y ^{c} h ^{s _{1}} _{1} h ^{s _{2}} _{2}

The Chaum-Pedersen protocol is an interactive method and needs some modification to be used in a non-interactive way:Replacing the randomly chosen

c by a 'secure hash' function with m as input value.

• • le secret
• sharing

References

• Markus, Publicly Verifiable Secret Sharing
• Be1999, pp.