How to share a secret
A Shamir - Communications of the ACM, 1979 - dl.acm.org
A Shamir
Communications of the ACM, 1979•dl.acm.orgIn 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.
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.
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.
ACM Digital Library