[Sha79] How to Share a Secret

Authors: Adi Shamir | Venue: Communications of the ACM | Source

Abstract

In this paper we show how to divide data $D$ into $n$ pieces in such a way that $D$ is easily reconstructable from any $k$ pieces, but even complete knowledge of $k-1$ pieces reveals absolutely no information about $D$. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes happen to some of the pieces.

BibTeX

Copy

@Article{Shamir79,
  author = {Adi Shamir},
  title = {How to Share a Secret},
  pages = {612--613},
  journal = {Communications of the Association for Computing Machinery},
  volume = {22},
  number = {11},
  month = {nov},
  year = {1979},
  doi = {10.1145/359168.359176},
}