ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
How to share a secret
Full text PdfPdf (194 KB)
Source
Communications of the ACM archive
Volume 22 ,  Issue 11  (November 1979) table of contents
Pages: 612 - 613  
Year of Publication: 1979
ISSN:0001-0782
Author
Adi Shamir  Massachusetts Institute of Technology, Cambridge
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 121,   Downloads (12 Months): 859,   Citation Count: 427
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359168.359176
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Blakley, G.R. Safeguarding cryptographic keys. Proc. AFIPS 1979 NCC, Vol. 48, Arlington, Va., June 1979, pp. 313-317.
 
3
 
4
Liu, C.L. Introduction to Combinatorial Mathematics. McGraw- Hill, New York, 1968.
5

CITED BY  431