How to share a secret
Communications of the ACM · 1979 · 14,041 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Z, A. S. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613. https://doi.org/10.1145/359168.359176
In text: (Z, 1979)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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 destroy half the pieces and security breaches expose all but one of the remaining pieces.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.