article

Free access

How to share a secret

Author:

Adi ShamirAuthors Info & Claims

Communications of the ACM, Volume 22, Issue 11

Pages 612 - 613

https://doi.org/10.1145/359168.359176

Published: 01 November 1979 Publication History

PDF eReader

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.

Digital Library

Google Scholar

[2]

Blakley, G.R. Safeguarding cryptographic keys. Proc. AFIPS 1979 NCC, Vol. 48, Arlington, Va., June 1979, pp. 313-317.

Google Scholar

[3]

Knuth, D. The Art of Computer Programming, Vol. 2: SeminumericalAlgorithms. Addison-Wesley, Reading, Mass., 1969.

Digital Library

Google Scholar

[4]

Liu, C.L. Introduction to Combinatorial Mathematics. McGraw- Hill, New York, 1968.

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Roy PKumar PBhattacharya A(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
https://doi.org/10.1016/j.future.2024.107520
Bhagat ASarma RSagar V(2025) Subfield codes of C-codes over Discrete Mathematics10.1016/j.disc.2024.114223348:1(114223)Online publication date: Jan-2025
https://doi.org/10.1016/j.disc.2024.114223
Li SYang WZhang FHuang XChen R(2025)Practical two-party SM2 signing using multiplicative-to-additive functionalityComputer Standards & Interfaces10.1016/j.csi.2024.10392892(103928)Online publication date: Mar-2025
https://doi.org/10.1016/j.csi.2024.103928
Show More Cited By

How to share a secret

Recommendations

Encrypting Keys Securely

Encryption keys are sometimes encrypted themselves; doing that properly requires special care. Although it might look like an oversight at first, the broadly accepted formal security definitions for cryptosystems don't allow encryption of key-dependent ...
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06: Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I

Design a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a ...
Towards the Forgery of a Group Signature without Knowing the Group Center's Secret
ICICS '01: Proceedings of the Third International Conference on Information and Communications Security

A group signature scheme allows the group member to sign messages on behalf of a group. In 1996, Kim et al. proposed a new type of group signature, called "convertible group signature". Recently, Saeednia pointed out that there are weaknesses in a ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 22, Issue 11

Nov. 1979

37 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/359168

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

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.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10,064
Total Citations
View Citations
31,298
Total Downloads

Downloads (Last 12 months)5,202
Downloads (Last 6 weeks)629

Reflects downloads up to 22 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Roy PKumar PBhattacharya A(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
https://doi.org/10.1016/j.future.2024.107520
Bhagat ASarma RSagar V(2025) Subfield codes of C-codes over Discrete Mathematics10.1016/j.disc.2024.114223348:1(114223)Online publication date: Jan-2025
https://doi.org/10.1016/j.disc.2024.114223
Li SYang WZhang FHuang XChen R(2025)Practical two-party SM2 signing using multiplicative-to-additive functionalityComputer Standards & Interfaces10.1016/j.csi.2024.10392892(103928)Online publication date: Mar-2025
https://doi.org/10.1016/j.csi.2024.103928
Li XWang HMa S(2025)An efficient ciphertext-policy weighted attribute-based encryption with collaborative access for cloud storageComputer Standards & Interfaces10.1016/j.csi.2024.10387291(103872)Online publication date: Jan-2025
https://doi.org/10.1016/j.csi.2024.103872
Zhang KLi ZWang YLi N(2025)Privacy-preserving nonlinear cloud-based model predictive control via affine maskingAutomatica10.1016/j.automatica.2024.111939171(111939)Online publication date: Jan-2025
https://doi.org/10.1016/j.automatica.2024.111939
Balboni PBella GCapparelli FBarata M(2025)Privacy-Enhancing TechnologiesComputer and Information Security Handbook10.1016/B978-0-443-13223-0.00054-0(891-905)Online publication date: 2025
https://doi.org/10.1016/B978-0-443-13223-0.00054-0
Mortensen BNordal MStrand M(2024)Matching radar signals and fingerprints with MPCIACR Communications in Cryptology10.62056/aywa0l5vtOnline publication date: 7-Oct-2024
https://doi.org/10.62056/aywa0l5vt
Kolby SRavi DYakoubov S(2024)Constant-Round YOSO MPC Without SetupIACR Communications in Cryptology10.62056/ae5w4fe-3Online publication date: 7-Oct-2024
https://doi.org/10.62056/ae5w4fe-3
Jin XYao YYu N(2024)Efficient secure aggregation for privacy-preserving federated learning based on secret sharingJUSTC10.52396/JUSTC-2022-011654:1(0104)Online publication date: 2024
https://doi.org/10.52396/JUSTC-2022-0116
Kozlitin O(2024)Протоколы дистанционного голосования. IIRemote voting protocols. IIМатематические вопросы криптографииMatematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]10.4213/mvk47815:3(83-100)Online publication date: 22-Oct-2024
https://doi.org/10.4213/mvk478
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Encrypting Keys Securely

Public-Key encryption from ID-Based encryption without one-time signature

Towards the Forgery of a Group Signature without Knowing the Group Center's Secret

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations