Autors:

CiteWeb id: 19790000006

CiteWeb score: 15715

DOI: 10.1145/359168.359176

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.

The publication "How to share a secret" is placed in the Top 1000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 100. Additionally, the publicaiton "How to share a secret" is placed in the Top 100 among other scientific works published in 1979.
Links to full text of the publication: