How to share a secret

@article{Shamir1979HowTS,
  title={How to share a secret},
  author={A. Shamir},
  journal={Commun. ACM},
  year={1979},
  volume={22},
  pages={612-613}
}
  • A. Shamir
  • Published 1979
  • Computer Science
  • Commun. ACM
In this paper we show how to divide data <italic>D</italic> into <italic>n</italic> pieces in such a way that <italic>D</italic> is easily reconstructable from any <italic>k</italic> pieces, but even complete knowledge of <italic>k</italic> - 1 pieces reveals absolutely no information about <italic>D</italic>. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces… Expand

Topics from this paper

An O(lg n) expected rounds randomized Byzantine generals protocol
How not to share a set of secrets
On secret sharing protocols
Single-bit re-encryption with applications to distributed proof systems
Secure Secret Sharing in the Cloud
...
1
2
3
4
5
...