How to Share a Secret.

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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1979
Accession Number
ADA069397

Entities

People

  • Adi Shamir

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Arithmetic Units
  • Computations
  • Computer Science
  • Computers
  • Cryptography
  • Death
  • Electrical Engineering
  • Executives
  • Massachusetts
  • Mathematics
  • Military Research
  • National Security
  • New York
  • Numbers
  • Polynomials
  • Scientists
  • Security

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Cybersecurity.
  • Educational Psychology
  • Graph Algorithms and Convex Optimization.