Non-interactive and information-theoretic secure verifiable secret sharing
TP Pedersen�- Annual international cryptology conference, 1991 - Springer
It is shown how to distribute a secret to n persons such that each person can verify that he
has received correct information about the secret without talking with other persons. Any k of
these persons can later find the secret (1≤ k≤ n), whereas fewer than k persons get no
(Shannon) information about the secret. The information rate of the scheme is 1/2 and the
distribution as well as the verification requires approximately 2 k modular multiplications pr.
bit of the secret. It is also shown how a number of persons can choose a secret “in the well”�…
has received correct information about the secret without talking with other persons. Any k of
these persons can later find the secret (1≤ k≤ n), whereas fewer than k persons get no
(Shannon) information about the secret. The information rate of the scheme is 1/2 and the
distribution as well as the verification requires approximately 2 k modular multiplications pr.
bit of the secret. It is also shown how a number of persons can choose a secret “in the well”�…
[PDF][PDF] Non-interactive and information-theoretic secure verifiable secret sharing
TP Pedersen - 1998 - cgi.di.uoa.gr
It is shown how to distribute a secret to n persons such that each person can verify that he
has received correct information about the secret without talking with other persons. Any к of
these persons can later find the secret (1< к< n), whereas fewer than к persons get no
(Shannon) information about the secret. The information rate of the scheme is^ and the
distribution as well as the verification requires approximately 2k modular multiplications pr.
bit of the secret. It is also shown how a number of persons can choose a secret" in the well"�…
has received correct information about the secret without talking with other persons. Any к of
these persons can later find the secret (1< к< n), whereas fewer than к persons get no
(Shannon) information about the secret. The information rate of the scheme is^ and the
distribution as well as the verification requires approximately 2k modular multiplications pr.
bit of the secret. It is also shown how a number of persons can choose a secret" in the well"�…
Showing the best results for this search. See all results