How to share a secret
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 destroy half the pieces and security breaches expose all but one of the remaining pieces.
Topics & Concepts
Computer scienceComputer securityKey (lock)CryptographyFunction (biology)Theoretical computer scienceEvolutionary biologyBiologyCryptography and Data SecurityChaos-based Image/Signal EncryptionCryptography and Residue Arithmetic