Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
How to share a secret
13.278
Zitationen
1
Autoren
1979
Jahr
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.
Ähnliche Arbeiten
A method for obtaining digital signatures and public-key cryptosystems
1983 · 13.107 Zit.
A method for obtaining digital signatures and public-key cryptosystems
1978 · 12.923 Zit.
A public key cryptosystem and a signature scheme based on discrete logarithms
1985 · 7.966 Zit.
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
2007 · 7.096 Zit.
Identity-Based Encryption from the Weil Pairing
2001 · 6.989 Zit.