How to Share a Secret

URL: https://dl.acm.org/doi/10.1145/359168.359176 Authors: Adi Shamir

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

@Inproceedings{EC:Mignotte82,
  author = {Maurice Mignotte},
  title = {How to Share a Secret?},
  pages = {371--375},
  editor = {Thomas Beth},
  booktitle = {Advances in Cryptology -- {EUROCRYPT}'82},
  volume = {149},
  series = {Lecture Notes in Computer Science},
  address = {Burg Feuerstein, Germany},
  month = {mar~29~--~apr~2},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {1983},
  doi = {10.1007/3-540-39466-4_27},
}