We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Materials Science/How to share a secret
PeriodicalsMaterials Science

How to share a secret

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Adi Shamir (1979). How to share a secret. Communications of the ACM, 22(11). https://doi.org/10.1145/359168.359176

Copy in another style

Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11). https://doi.org/10.1145/359168.359176
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.