Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  • Authors:
  • Torben P. Pedersen

  • Affiliations:
  • -

  • Venue:
  • CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
  • Year:
  • 1991

Quantified Score

Hi-index 0.02

Visualization

Abstract

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 2k modular multiplications pr. bit of the secret. It is also shown how a number of persons can choose a secret "in the well" and distribute it veritably among themselves.