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
Flagged first, then by citations
Cited by
Sorted by citations
Items 401–500 of 1,021
Benaloh, J. (2006) · Cited by 162
Supporting Regularized Logistic Regression Privately and Efficiently
Li, W., Liu, H., Yang, P., & Xie, W. (2016) · PLoS ONE · doi:10.1371/journal.pone.0156479 · Cited by 163
Quantum secret sharing with qudit graph states
Keet, A., Fortescue, B., Markham, D., & Sanders, B. C. (2010) · Physical Review A · doi:10.1103/physreva.82.062315 · Cited by 162
Molva, R. A., & Pietro Michiardi, A. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39867-7_69 · Cited by 161
Sticky Policies: An Approach for Managing Privacy across Multiple Parties
Pearson, S., & Mont, M. C. (2011) · Computer · doi:10.1109/mc.2011.225 · Cited by 161
Chaum, D., Carback, R., Clark, J., Essex, A., Popoveniuc, S., Rivest, R. L., Ryan, P. Y. A., Shen, E., & Sherman, A. T. (2008) · doi:10.13016/m23zj3-ks6e · Cited by 161
Efficient Robust Private Set Intersection
Dachman-Soled, D., Malkin, T., Raykova, M., & Yung, M. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_8 · Cited by 160
Outsourcing Large Matrix Inversion Computation to A Public Cloud
Lei, X., Liao, X., Huang, T., Li, H., & Hu, C. (2013) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2013.7 · Cited by 161
Secure Distributed Deduplication Systems with Improved Reliability
Li, J., Chen, X., Huang, X., Tang, S., Xiang, Y., Hassan, M. M., & Alelaiwi, A. A. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2401017 · Cited by 160
Privacy preserving cloud data access with multi-authorities
Jung, T., Li, X., Wan, Z., & Wan, M. (2013) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2013.6567070 · Cited by 160
Distributed Software-based Attestation for Node Compromise Detection in Sensor Networks
Yang, Y. X., Wang, X., Zhu, S., & Cao, G. (2007) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2007.31 · Cited by 160
Dwivedi, A. D., Singh, R., Kaushik, K., Mukkamala, R. R., & Alnumay, W. S. (2021) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.4329 · Cited by 160
Malkhi, D., & Reiter, M. K. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258650 · Cited by 160
Design Choices for Central Bank Digital Currency: Policy and Technical Considerations
Allen, S. E., Čapkun, S., Eyal, I., Fanti, G. C., Ford, B., Grimmelmann, J., Juels, A., Kostiainen, K., Meiklejohn, S., Miller, A., et al. (2020) · National Bureau of Economic Research · doi:10.3386/w27634 · Cited by 166
Multistage secret sharing based on one-way function
He, J., & Dawson, E. (1994) · Electronics Letters · doi:10.1049/el:19941076 · Cited by 159
Liu, Y., Liu, S., Wang, Y., Zhao, H., & Liu, S. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.09.091 · Cited by 159
Some recent research aspects of threshold cryptography
Desmedt, Y. (1998) · Lecture notes in computer science · doi:10.1007/bfb0030418 · Cited by 159
Chosen-Ciphertext Security of Multiple Encryption
Dodis, Y., & Katz, J. I. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_11 · Cited by 159
Shared Generation of Authenticators and Signatures (Extended Abstract)
Desmedt, Y., & Frankel, Y. (1991) · UCL Discovery (University College London) · Cited by 159
Randomized Byzantine Agreements
Toueg, S. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806744 · Cited by 159
Embedded Extended Visual Cryptography Schemes
Liu, F., & Wu, C.-K. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2116782 · Cited by 158
A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing
Pang, L., & Wang, Y. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2004.06.120 · Cited by 157
Chen, L., Lu, R., & Cao, Z. (2014) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-014-0255-5 · Cited by 157
A Comprehensive Study of Visual Cryptography
Weir, J., & Yan, W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14298-7_5 · Cited by 155
Visual secret sharing for multiple secrets
Feng, J.-B., Wu, H.-C., Tsai, C., Chang, Y., & Chu, Y. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.05.031 · Cited by 154
SoK of used cryptography in blockchain
Raikwar, M., Gligoroski, D., & Kralevska, K. (2019) · IEEE Access · doi:10.1109/access.2019.2946983 · Cited by 153
Li, W., Xue, K., Xue, Y., & Hong, J. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2448095 · Cited by 153
Graph decompositions and secret sharing schemes
Blundo, C., Santis, A. D., Stinson, D. R., & Vaccaro, U. (1995) · Journal of Cryptology · doi:10.1007/bf00204801 · Cited by 153
Ferguson, N. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_28 · Cited by 152
Perfectly Secure Password Protocols in the Bounded Retrieval Model
Crescenzo, G. D., Lipton, R., & Walfish, S. (2006) · Lecture notes in computer science · doi:10.1007/11681878_12 · Cited by 151
FADE: Secure Overlay Cloud Storage with File Assured Deletion
Tang, Y. S., Lee, P. P. C., Lui, J. C. S., & Perlman, R. (2010) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-16161-2_22 · Cited by 151
Cheating Prevention in Visual Cryptography
Hu, C.-M., & Tzeng, W.-G. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.884916 · Cited by 151
SCRAPE: Scalable Randomness Attested by Public Entities
Cascudo, I., & David, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61204-1_27 · Cited by 151
BC-SABE: Blockchain-Aided Searchable Attribute-Based Encryption for Cloud-IoT
Liu, S., Yu, J., Xiao, Y., Wan, Z., Wang, S., & Yan, B. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2993231 · Cited by 151
EPPDA: An Efficient Privacy-Preserving Data Aggregation Federated Learning Scheme
Song, J., Wang, W., Gadekallu, T. R., Cao, J., & Liu, Y. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3153519 · Cited by 150
Circular quantum secret sharing
Deng, F., Zhou, H.-Y., & Long, G. L. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/45/018 · Cited by 152
Cloud-assisted secure video transmission and sharing framework for smart cities
Hossain, M. S., Muhammad, G., Abdul, W., Song, B., & Gupta, B. B. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.03.029 · Cited by 150
Towards fault-tolerant and secure agentry
Schneider, F. B. (1997) · Lecture notes in computer science · doi:10.1007/bfb0030670 · Cited by 150
Harn, L. (2012) · IEEE Transactions on Computers · doi:10.1109/tc.2012.251 · Cited by 149
NPP: A New Privacy-Aware Public Auditing Scheme for Cloud Data Sharing with Group Users
Fu, A., Yu, S., Zhang, Y., Wang, H., & Huang, C. (2017) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2017.2701347 · Cited by 149
Privacy-enhancing k -anonymization of customer data
Zhong, S., Yang, Z., & Wright, R. N. (2005) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1065167.1065185 · Cited by 150
A survey on secure multipath routing protocols in WSNs
Stavrou, E., & Pitsillides, A. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.02.015 · Cited by 148
LEDS: Providing Location-Aware End-to-End Data Security in Wireless Sensor Networks
Ren, K., Lou, W., & Zhang, Y.-C. S. L.-G. (2008) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.70753 · Cited by 148
An Auction Protocol Which Hides Bids of Losers
Sako, K. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_28 · Cited by 148
The Design and Implementation of a Transparent Cryptographic File System for UNIX
Cattaneo, G., Catuogno, L., Sorbo, A. D., & Persiano, P. (2001) · CINECA IRIS Institutial research information system (Parthenope University of Naples) · Cited by 148
On the information rate of perfect secret sharing schemes
van Dijk, M. (1995) · Designs Codes and Cryptography · doi:10.1007/bf01398012 · Cited by 148
Some improved bounds on the information rate of perfect secret sharing schemes
Brickell, E. F., & Stinson, D. R. (1992) · Journal of Cryptology · doi:10.1007/bf02451112 · Cited by 148
Challenges, Applications and Design Aspects of Federated Learning: A Survey
Rahman, K. M. J., Ahmed, F., Akhter, N., Hasan, M., Amin, R., Aziz, K. E., Islam, A. K. M. M., Mukta, M. S. H., & Islam, A. K. M. N. (2021) · IEEE Access · doi:10.1109/access.2021.3111118 · Cited by 147
Cheating in Visual Cryptography
Horng, G., Chen, T., & Tsai, D.-S. (2006) · Designs Codes and Cryptography · doi:10.1007/s10623-005-6342-0 · Cited by 147
Mitigating Packet Dropping Problem in Mobile Ad Hoc Networks: Proposals and Challenges
Djahel, S., Naït‐Abdesselam, F., & Zhang, Z. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.072210.00026 · Cited by 147
Secure attribute-based systems
Pirretti, M., Traynor, P., McDaniel, P. D., & Waters, B. R. (2010) · Journal of Computer Security · doi:10.3233/jcs-2009-0383 · Cited by 147
Tonyalı, S., Akkaya, K., Saputro, N., Uluagac, A. S., & Nojoumian, M. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.04.031 · Cited by 147
Some Applications of Coding Theory in Computational ComplexityPreprint
Trevisan, L. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0409044 · Cited by 147
New Colored Visual Secret Sharing Schemes
Yang, C., & Laih, C. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008382327051 · Cited by 146
Secure Key Agreement and Key Protection for Mobile Device User Authentication
Wu, L., Wang, J., Choo, K. R., & He, D. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2850299 · Cited by 146
SoK: General Purpose Compilers for Secure Multi-Party Computation
Hastings, M., Hemenway, B., Noble, D., & Zdancewic, S. (2019) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2019.00028 · Cited by 161
Privacy-preserving federated learning for residential short-term load forecasting
Fernández, J. D., Menci, S. P., Lee, C. M., Rieger, A., & Fridgen, G. (2022) · Applied Energy · doi:10.1016/j.apenergy.2022.119915 · Cited by 157
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
Canetti, R., & Goldwasser, S. (1999) · Cited by 146
Mossel, E., & Peres, Y. (2003) · The Annals of Applied Probability · doi:10.1214/aoap/1060202828 · Cited by 146
A methodology for the pseudonymization of medical data
Neubauer, T., & Heurix, J. (2010) · International Journal of Medical Informatics · doi:10.1016/j.ijmedinf.2010.10.016 · Cited by 146
Quantum scheme for secret sharing based on local distinguishability
Rahaman, R., & Parker, M. G. (2015) · Physical Review A · doi:10.1103/physreva.91.022330 · Cited by 144
Scalable and Privacy-Preserving Data Sharing Based on Blockchain
Zheng, B., Zhu, L., Shen, M., Gao, F., Zhang, C., Li, Y., & Yang, J. (2018) · Journal of Computer Science and Technology · doi:10.1007/s11390-018-1840-5 · Cited by 144
Yu, K., Tan, L., Yang, C., Choo, K. R., Bashir, A. K., Rodrigues, J. J. P. C., & Sato, T. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3125190 · Cited by 144
Personalised cryptographic key generation based on FaceHashing
Teoh, A. B. J., Ngo, D. C. L., & Goh, A. (2004) · Computers & Security · doi:10.1016/j.cose.2004.06.002 · Cited by 143
Secure Arithmetic Computation with No Honest Majority
Ishai, Y., Prabhakaran, M., & Sahai, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_18 · Cited by 143
A Survey on Attribute-based Encryption Schemes of Access Control in Cloud Environments
Lee, C., Chung, P.-S., & Hwang, M. (2013) · International journal of network security · doi:10.6633/ijns.201307.15(4).01 · Cited by 143
A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy
Goryczka, S., & Xiong, L. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2484326 · Cited by 147
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
Chida, K., Genkin, D., Hamada, K., Ikarashi, D., Kikuchi, R., Lindell, Y., & Nof, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_2 · Cited by 143
Quantum Secret Sharing Among Four Players Using Multipartite Bound Entanglement of an Optical Field
Zhou, Y., Yu, J., Yan, Z., Jia, X., Zhang, J., Xie, C., & Peng, K. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.150502 · Cited by 143
Yang, A., Weng, J., Yang, K., Huang, C., & Shen, X. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3024000 · Cited by 143
Ng, J. S., Lim, W. Y. B., Luong, N. C., Xiong, Z., Asheralieva, A., Niyato, D. T., Leung, C., & Miao, C. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3091684 · Cited by 151
Robust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (2001) · Information and Computation · doi:10.1006/inco.2000.2881 · Cited by 143
Secret sharing with a single d -level quantum system
Tavakoli, A., Herbauts, I., Żukowski, M., & Bourennane, M. (2015) · Physical Review A · doi:10.1103/physreva.92.030302 · Cited by 142
Privacy preserving decision tree learning over multiple parties
Emekçi, F., Sahin, O. D., Agrawal, D., & Abbadi, A. E. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.02.004 · Cited by 142
Efficient and Privacy-Preserving Truth Discovery in Mobile Crowd Sensing Systems
Xu, G., Li, H., Liu, S., Wen, M., & Lu, R. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2895834 · Cited by 142
Federated transfer learning: Concept and applications
Saha, S., & Ahmad, T. (2021) · Intelligenza Artificiale · doi:10.3233/ia-200075 · Cited by 151
Efficient Dropout-Resilient Aggregation for Privacy-Preserving Machine Learning
Liu, Z., Guo, J., Lam, K., & Zhao, J. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3163592 · Cited by 145
Firouzi, F., Jiang, S., Chakrabarty, K., Farahani, B., Daneshmand, M., Song, J., & Mankodiya, K. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3191881 · Cited by 142
A Novel Persistence Associated EBV miRNA Expression Profile Is Disrupted in Neoplasia
Qiu, J. J., Cosmopoulos, K., Pegtel, D. M., Hopmans, E. S., Murray, P. G., Middeldorp, J. M., Shapiro, M., & Thorley‐Lawson, D. A. (2011) · PLoS Pathogens · doi:10.1371/journal.ppat.1002193 · Cited by 141
Multilevel diversity coding with distortion
Yeung, R. W. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370142 · Cited by 141
A survey of key management in ad hoc networks
Hegland, A. M., Winjum, E., Mjølsnes, S. F., Rong, C., Kure, Ø., & Spilling, P. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.253271 · Cited by 141
Detecting Sybil Attacks Using Proofs of Work and Location in VANETs
Baza, M., Nabil, M., Abdallah, M. M., Bewermeier, N., Fidan, K., Alasmary, W., & Abdallah, M. M. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.2993769 · Cited by 141
Multiparty Homomorphic Encryption from Ring-Learning-with-Errors
Mouchet, C., Troncoso-Pastoriza, J. R., Bossuat, J.-P., & Hubaux, J. (2021) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2021-0071 · Cited by 153
Self-Sovereign Identity: A Systematic Review, Mapping and Taxonomy
Schardong, F., & Custódio, R. F. (2022) · Sensors · doi:10.3390/s22155641 · Cited by 163
A Review of Industry 4.0 Manufacturing Process Security Risks
Prinsloo, J., Sinha, S., & von Solms, B. (2019) · Applied Sciences · doi:10.3390/app9235105 · Cited by 140
Rationality and Adversarial Behavior in Multi-party Computation
Lysyanskaya, A., & Triandopoulos, N. (2006) · Lecture notes in computer science · doi:10.1007/11818175_11 · Cited by 140
A taxonomy for privacy enhancing technologies
Heurix, J., Zimmermann, P., Neubauer, T., & Fenz, S. (2015) · Computers & Security · doi:10.1016/j.cose.2015.05.002 · Cited by 153
Encrypted Control for Networked Systems: An Illustrative Introduction and Current Challenges
Darup, M. S., Alexandru, A. B., Quevedo, D. E., & Pappas, G. J. (2021) · IEEE Control Systems · doi:10.1109/mcs.2021.3062956 · Cited by 140
A practical and provably secure scheme for publicly verifiable secret sharing and its applications
Fujisaki, E., & Okamoto, T. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054115 · Cited by 140
Protocols for Secure Remote Database Access with Approximate Matching
Du, W. K., & Atallah, M. J. (2001) · Advances in information security · doi:10.1007/978-1-4615-1467-1_6 · Cited by 140
Secure traceroute to detect faulty or malicious routing
Padmanabhan, V. N., & Simon, D. R. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774775 · Cited by 140
Micali, S. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_9 · Cited by 140
Public Integrity Auditing for Dynamic Data Sharing With Multiuser Modification
Yuan, J., & Yu, S. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2423264 · Cited by 139
Censorship Resistant Peer-to-Peer Content Addressable Networks
Fiat, A., Saia, J., Hobbes, T., Descartes, R., Bacon, F., Spinoza, B., Milton, J., Locke, J., Hume, D., Rousseau, J.-J., et al. (2001) · Cited by 139
An efficient nonrepudiable threshold proxy signature scheme with known signers
Sun, H. (1999) · Computer Communications · doi:10.1016/s0140-3664(99)00029-8 · Cited by 139
A survey of survivability in mobile ad hoc networks
Nogueira, M., dos Santos, A. L., & Pujolle, G. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090106 · Cited by 138
On the Capacity of Secure Distributed Matrix Multiplication
Chang, W.-T., & Tandon, R. (2018) · Globecom · doi:10.1109/glocom.2018.8647313 · Cited by 138
Hu, R., Guo, Y., & Gong, Y. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3343288 · Cited by 147
BCHealth: A Novel Blockchain-based Privacy-Preserving Architecture for IoT Healthcare Applications
Hossein, K. M., Esmaeili, M. E., Dargahi, T., Khonsari, A., & Conti, M. (2021) · Computer Communications · doi:10.1016/j.comcom.2021.08.011 · Cited by 139
Universal Atomic Swaps: Secure Exchange of Coins Across All Blockchains
Thyagarajan, S. A. K., Malavolta, G., & Moreno-Sánchez, P. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833731 · Cited by 140
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
