Thumbnail
Access Restriction
Subscribed

Author Shamir, Adi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF ♦ HTM / HTML
Language English
Subject Keyword Interpolation ♦ Key management ♦ Cryptography
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.
Description Affiliation: Massachusetts Institute of Technology, Cambridge (Shamir, Adi)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 11
Page Count 2
Starting Page 612
Ending Page 613


Open content in new tab

   Open content in new tab
Source: ACM Digital Library