Annual International Cryptology Conference

CRYPTO 1991: Advances in Cryptology — CRYPTO ’91 pp 129-140

Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  • Torben Pryds Pedersen
Conference paper

DOI: 10.1007/3-540-46766-1_9

Volume 576 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Pedersen T.P. (1992) Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg

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 ≤ kn), 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 verifiably among themselves.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Torben Pryds Pedersen
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityDenmark