How to Share a Secret
Name
MIT-LCS-TM-134.pdf
Size
1.07 MB
Format
Adobe PDF
Checksum (MD5)
43816328fe380a9b142ef7d33ad0afd7
Author(s)
Shamir, Adi
Date Issued
May 1979
Series/Report no.
MIT-LCS-TM-134
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.
Persistent DSpace Link