The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
How to share a secret
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The scheme proposed by Shamir relies on standard Lagrange polynomial interpolation, while Blakley's proposal, also known as vector scheme, relies on the geometric concept of intersecting hyperplanes.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [123]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In 1979, Shamir [123] and Blakely [124] proposed two variations of threshold-based secret sharing schemes.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [123]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,097
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Introduction to Combinatorial Mathematics.
Moon, J. W., Dantzig, G. B., & Liu, C. L. (1971) · American Mathematical Monthly · doi:10.2307/2317652 · Cited by 615
INTRODUCTION TO COMBINATORIAL MATHEMATICS
Williamson, S. (1969) · Bulletin of the London Mathematical Society · doi:10.1112/blms/1.3.431 · Cited by 446
Cited by
Sorted by citations
Items 1,001–1,021 of 1,021
Gągol, A., Leśniak, D., Straszak, D., & Świętek, M. (2019) · ACM Conference on Advances in Financial Technologies (AFT) · doi:10.1145/3318041.3355467 · Cited by 70
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Practical and Robust Federated Learning With Highly Scalable Regression Training
Han, S., Ding, H., Zhao, S., Ren, S., Wang, Z., Lin, J., & Zhou, S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3271859 · Cited by 60
Homomorphic Encryption Based Privacy-Preservation for IoMT
Salim, M. M., Kim, I., Doniyor, U., Lee, C., & Park, J. H. (2021) · Applied Sciences · doi:10.3390/app11188757 · Cited by 57
Boosting Privately: Privacy-Preserving Federated Extreme Boosting for Mobile Crowdsensing
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., & Deng, R. (2019) · arXiv · doi:10.48550/arxiv.1907.10218 · Cited by 52
RevFRF: Enabling Cross-Domain Random Forest Training With Revocable Federated Learning
Liu, Y., Ma, Z., Yang, Y., Liu, X., Ma, J., & Ren, K. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3104842 · Cited by 49
Zhang, H., Yu, J., Tian, C., Zhao, P., Xu, G., & Lin, J. (2018) · IEEE Access · doi:10.1109/access.2018.2857205 · Cited by 45
A secure self-destructing scheme for electronic data
Wang, G., Yue, F., & Liu, Q. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2012.05.008 · Cited by 44
A Generic Federated Recommendation Framework via Fake Marks and Secret Sharing
Lin, Z., Pan, W., Yang, Q., & Ming, Z. (2023) · ACM Transactions on Information Systems · doi:10.1145/3548456 · Cited by 44
Data privacy in the age of personal genomics
Grishin, D., Obbad, K., & Church, G. M. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0271-3 · Cited by 38
Practical Key Recovery Model for Self-Sovereign Identity Based Digital Wallets
Soltani, R., Nguyen, U. T., & An, A. (2019) · 2019 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc/picom/cbdcom/cyberscitech.2019.00066 · Cited by 39
A Quantum Cryptographic Protocol for Secure Vehicular Communication
Sutradhar, K. (2024) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3322728 · Cited by 34
Fault-Tolerant Privacy-Preserving Data Aggregation for Smart Grid
Liu, H., Gu, T., Liu, Y., Song, J., & Zeng, Z. (2020) · Wireless Communications and Mobile Computing · doi:10.1155/2020/8810393 · Cited by 17
Biometrics-based identifiers for digital identity management
Bhargav-Spantzel, A., Squicciarini, A., Bertino, E., Kong, X., & Zhang, W. (2010) · Proceedings of the 9th Symposium on Identity and Trust on the Internet · doi:10.1145/1750389.1750401 · Cited by 11
Efficient Group-Key Management for Low-bandwidth Smart Grid Networks
Hanna, Y., Cebe, M., Mercan, S., & Akkaya, K. (2021) · 2021 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) · doi:10.1109/smartgridcomm51999.2021.9631988 · Cited by 8
Decentralized and Privacy-Preserving Key Management Model
Soltani, R., Nguyen, U. T., & An, A. (2020) · 2020 International Symposium on Networks, Computers and Communications (ISNCC) · doi:10.1109/isncc49221.2020.9297294 · Cited by 8
IoT Expunge: Implementing Verifiable Retention of IoT Data
Panwar, N., Sharma, S., Gupta, P., Ghosh, D., Mehrotra, S., & Venkatasubramanian, N. (2020) · Proceedings of the Tenth ACM Conference on Data and Application Security and Privacy · doi:10.1145/3374664.3375737 · Cited by 6
“Thus, the decryption key can be distributed among multiple peers of secret-shared form [38] to avoid key reconstruction, unless peers collude with each other, which is hard to”
BackgroundNair, D. G., Binu, V. P., & Kumar, G. S. (2014) · 2014 International Conference on Data Science & Engineering (ICDSE) · doi:10.1109/icdse.2014.6974639 · Cited by 11
Function-Based Access Control (FBAC): Towards Preventing Insider Threats in Organizations
Desmedt, Y., & Shaghaghi, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-04834-1_8 · Cited by 5
Efficient & secure image availability and content protection
Noura, H., Noura, M., Salman, O., Couturier, R., & Chehab, A. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09057-4 · Cited by 4
TMRB: Trusted Multimedia Scheme With Redactable Blockchain
Zhang, T. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3542637 · Cited by 3
Metadata
- Authors
- Shamir, A.
- Affiliations
- Massachusetts Institute of Technology, Cambridge
- Venue
- Communications of the ACM
- Published
- 1979-11
- Volume
- 22
- Issue
- 11
- Pages
- 612-613
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2141420453
- Cited by
- 13,756
- References
- 7
- Citations by year
- 2026: 467 · 2025: 758 · 2024: 675 · 2023: 713 · 2022: 643 · 2021: 719 · 2020: 697 · 2019: 670 · 2018: 602 · 2017: 545 · 2016: 563 · 2015: 606 · 2014: 586 · 2013: 617 · 2012: 562
- FWCI
- 7.12
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Communications of the ACM (publishedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- Defense Technical Information Center (DTIC) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- secret sharing, information-theoretic security, key management, cryptographic key distribution, data redundancy, fault tolerance, security breaches
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
