How to share a secret

Volume: 22, Issue: 11, Pages: 612 - 613
Published: Nov 1, 1979
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...
Paper Details
Title
How to share a secret
Published Date
Nov 1, 1979
Volume
22
Issue
11
Pages
612 - 613
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.