Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0414.94021
Shamir, Adi
How to share a secret. (English)
[J] Commun. ACM 22, 612-613 (1979). ISSN 0001-0782

Summary: 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.

Display scanned Zentralblatt-MATH page with this review.

MSC 2000:: *94A62 Authentication and secret sharing
94A60 Cryptography

Keywords: key management; cryptographic systems

Cited in: Zbl 1197.94219 Zbl 0956.94013 Zbl 0890.94031 Zbl 0659.94008

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]