vix.ing · top · new · best · stats

How to share a secret

1979/11/01 by Adi Shamir · 13,530 citations
Computer Science · #Chaos-based Image/Signal Encryption #Computer science #Computer security #Cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #Function (biology) #Key (lock) #Theoretical computer science

paper · pdf · doi:10.1145/359168.359176

published in Communications of the ACM 22(11), 612-613 (Association for Computing Machinery)

openalex publication_date 1979/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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.

Cited by

Related