[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

How to share a secret

Published: 01 November 1979 Publication History

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.

References

[1]
Aho, A., Hopcroft, J., and Ullman, J. The Design and Analysis of Computer AIgorithms. Addison-Wesley, Reading, Mass., 1974.
[2]
Blakley, G.R. Safeguarding cryptographic keys. Proc. AFIPS 1979 NCC, Vol. 48, Arlington, Va., June 1979, pp. 313-317.
[3]
Knuth, D. The Art of Computer Programming, Vol. 2: SeminumericalAlgorithms. Addison-Wesley, Reading, Mass., 1969.
[4]
Liu, C.L. Introduction to Combinatorial Mathematics. McGraw- Hill, New York, 1968.
[5]
Rivest, R., Shamir, A., and Adleman, L. A method for obtaining digital signatures and public-key cryptosystems. Comm. A CM 21, 2 (Feb. 1978), 120-126.

Cited By

View all
  • (2025)Secure Two-Party Frequent Itemset Mining With Guaranteeing Differential PrivacyIEEE Transactions on Mobile Computing10.1109/TMC.2024.346474424:1(276-292)Online publication date: Jan-2025
  • (2025)Third layer blockchains are being rapidly developed: Addressing state-of-the-art paradigms and future horizonsJournal of Network and Computer Applications10.1016/j.jnca.2024.104044233(104044)Online publication date: Jan-2025
  • (2025)Hierarchical Threshold Multi-Key Fully Homomorphic EncryptionJournal of Information Security and Applications10.1016/j.jisa.2024.10391989(103919)Online publication date: Mar-2025
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 22, Issue 11
Nov. 1979
37 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/359168
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1979
Published in CACM Volume 22, Issue 11

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cryptography
  2. interpolation
  3. key management

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5,062
  • Downloads (Last 6 weeks)622
Reflects downloads up to 11 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2025)Secure Two-Party Frequent Itemset Mining With Guaranteeing Differential PrivacyIEEE Transactions on Mobile Computing10.1109/TMC.2024.346474424:1(276-292)Online publication date: Jan-2025
  • (2025)Third layer blockchains are being rapidly developed: Addressing state-of-the-art paradigms and future horizonsJournal of Network and Computer Applications10.1016/j.jnca.2024.104044233(104044)Online publication date: Jan-2025
  • (2025)Hierarchical Threshold Multi-Key Fully Homomorphic EncryptionJournal of Information Security and Applications10.1016/j.jisa.2024.10391989(103919)Online publication date: Mar-2025
  • (2025)ZeroVCS: An efficient authentication protocol without trusted authority for zero-trust vehicular communication systemsFuture Generation Computer Systems10.1016/j.future.2024.107520163(107520)Online publication date: Feb-2025
  • (2025) Subfield codes of C-codes over Discrete Mathematics10.1016/j.disc.2024.114223348:1(114223)Online publication date: Jan-2025
  • (2025)Practical two-party SM2 signing using multiplicative-to-additive functionalityComputer Standards & Interfaces10.1016/j.csi.2024.10392892(103928)Online publication date: Mar-2025
  • (2025)An efficient ciphertext-policy weighted attribute-based encryption with collaborative access for cloud storageComputer Standards & Interfaces10.1016/j.csi.2024.10387291:COnline publication date: 1-Jan-2025
  • (2025)From accuracy to approximation: A survey on approximate homomorphic encryption and its applicationsComputer Science Review10.1016/j.cosrev.2024.10068955(100689)Online publication date: Feb-2025
  • (2025)Oblivious and distributed firewall policies for securing firewalls from malicious attacksComputers & Security10.1016/j.cose.2024.104201150(104201)Online publication date: Mar-2025
  • (2025)Privacy-preserving nonlinear cloud-based model predictive control via affine maskingAutomatica10.1016/j.automatica.2024.111939171(111939)Online publication date: Jan-2025
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media