Access the full text.
Sign up today, get DeepDyve free for 14 days.
knowledge of any k or more D i pieces makes D easily computable
J. Moon, G. Dantzig, C. Liu (1971)
Introduction to Combinatorial Mathematics.American Mathematical Monthly, 78
G. Blakley (1899)
Safeguarding cryptographic keys1979 International Workshop on Managing Requirements Knowledge (MARK)
LThe polynomials can be replaced by any other collection of functions which are easy to evaluate and to interpolate
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
D. Knuth (1968)
The Art of Computer Programming
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.
Communications of the ACM – Association for Computing Machinery
Published: Nov 1, 1979
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.