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 201–300 of 1,021
A Practical Privacy-Preserving Data Aggregation (3PDA) Scheme for Smart Grid
Liu, Y., Guo, W., Fan, C., Chang, L., & Chi, C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2809672 · Cited by 289
Federated learning in a medical context: A systematic literature review
Pfitzner, B., Steckhan, N., & Arnrich, B. (2021) · ACM Transactions on Internet Technology · doi:10.1145/3412357 · Cited by 288
Privacy in the Smart City—Applications, Technologies, Challenges, and Solutions
Eckhoff, D., & Wagner, I. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2748998 · Cited by 287
Controlling Access to Published Data Using Cryptography
Miklau, G., & Suciu, D. M. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50084-7 · Cited by 287
Storer, M. W., Greenan, K. M., Long, D. D. E., & Miller, E. L. (2008) · doi:10.1145/1456469.1456471 · Cited by 287
Privacy and Data Protection by Design - from policy to engineeringPreprint
Danezis, G., Domingo‐Ferrer, J., Hansen, M., Hoepman, J.-H., Métayer, D. L., Tirtea, R., & Schiffner, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.03726 · Cited by 307
Privacy and Security Issues in Deep Learning: A Survey
Liu, X., Xie, L., Wang, Y., Zou, J., Xiong, J., Ying, Z., & Vasilakos, A. V. (2020) · IEEE Access · doi:10.1109/access.2020.3045078 · Cited by 311
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. I. (2007) · Journal of Cryptology · doi:10.1007/s00145-006-0442-5 · Cited by 284
On the classification of ideal secret sharing schemes
Brickell, E. F., & Davenport, D. M. (1991) · Journal of Cryptology · doi:10.1007/bf00196772 · Cited by 284
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning
Wagh, S., Tople, S., Benhamouda, F., Kushilevitz, E., Mittal, P., & Rabin, T. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2021-0011 · Cited by 324
Blockchain-based Personal Health Data Sharing System Using Cloud Storage
Zheng, X., Mukkamala, R. R., Vatrapu, R., & Ordieres-Mere, J. (2018) · 2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom) · doi:10.1109/healthcom.2018.8531125 · Cited by 281
Enforcing access control in Web-based social networks
Carminati, B., Ferrari, E., & Perego, A. (2009) · ACM Transactions on Information and System Security · doi:10.1145/1609956.1609962 · Cited by 281
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
SAFELearn: Secure Aggregation for private FEderated Learning
Fereidooni, H., Marchal, S., Miettinen, M., Mirhoseini, A., Möllering, H., Nguyen, T. D., Rieger, P., Sadeghi, A., Schneider, T. H., Yalame, H., et al. (2021) · IEEE Security and Privacy Workshops (SPW) · doi:10.1109/spw53761.2021.00017 · Cited by 298
MOCA : MObile Certificate Authority for Wireless Ad Hoc Networks
Yi, S., & Kravets, R. H. (2004) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 279
A Secure Data Sharing Platform Using Blockchain and Interplanetary File System
Naz, M., Al-Zahrani, F. A., Khalid, R., Javaid, N., Qamar, A. M., Afzal, M. K., & Shafiq, M. (2019) · Sustainability · doi:10.3390/su11247054 · Cited by 287
The design and implementation of a secure auction service
Franklin, M. K., & Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.502223 · Cited by 275
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Stinson, D. R., & Wei, R. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480196304246 · Cited by 272
Wang, G., Shi, Z. J., Nixon, M. S., & Han, S. (2019) · ACM Conference on Advances in Financial Technologies (AFT) · doi:10.1145/3318041.3355457 · Cited by 272
Berkovits, S. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_50 · Cited by 271
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 270
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Bar‐Ilan, J., & Beaver, D. (1989) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/72981.72995 · Cited by 269
Privacy-Preserving Federated Learning Framework Based on Chained Secure Multiparty Computing
Li, Y., Zhou, Y., Jolfaei, A., Yu, D., Xu, G., & Zheng, X. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3022911 · Cited by 268
Foundations of Secure Interactive Computing
Beaver, D. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_31 · Cited by 267
Communication complexity of secure computation (extended abstract)
Franklin, M. K., & Yung, M. M. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129780 · Cited by 267
Threshold proxy signature schemes
Zhang, K. (1998) · Lecture notes in computer science · doi:10.1007/bfb0030429 · Cited by 266
An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys
Liu, X., Deng, R. H., Choo, K. R., & Weng, J. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2573770 · Cited by 263
Efficient and Generalized Group Signatures
Camenisch, J. L. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_32 · Cited by 263
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Cramer, R., Dodis, Y., Fehr, S., Padró, C., & Wichs, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_27 · Cited by 262
Securely outsourcing linear algebra computations
Atallah, M. J., & Frikken, K. B. (2010) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1755688.1755695 · Cited by 261
Sharing secrets in stego images with authentication
Chang, C., Hsieh, Y.-P., & Lin, C.-H. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.04.006 · Cited by 261
Fast Multiparty Threshold ECDSA with Fast Trustless Setup
Gennaro, R., & Goldfeder, S. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243859 · Cited by 261
Securing threshold cryptosystems against chosen ciphertext attack
Shoup, V., & Gennaro, R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054113 · Cited by 260
When Federated Learning Meets Privacy-Preserving Computation
Chen, J., Yan, H., Liu, Z., Zhang, M., Xiong, H., & Yu, S. (2024) · ACM Computing Surveys · doi:10.1145/3679013 · Cited by 278
Goldwasser, S., & Bellare, M. (1996) · Cited by 259
Visual cryptography for gray-level images by dithering techniques
Lin, C.-C., & Tsai, W. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00259-3 · Cited by 258
Two secret sharing schemes based on Boolean operations
Wang, D., Zhang, L., Ma, N., & Li, X. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.11.018 · Cited by 257
Constant Size Ciphertexts in Threshold Attribute-Based Encryption
Herranz, J., Laguillaumie, F., & Ràfols, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13013-7_2 · Cited by 256
On the size of shares for secret sharing schemes
Capocelli, R. M., Santis, A. D., Gargano, L., & Vaccaro, U. (1993) · Journal of Cryptology · doi:10.1007/bf00198463 · Cited by 256
Integrated metasurfaces for re-envisioning a near-future disruptive optical platform
Yang, Y., Seong, J., Choi, M., Park, J., Kim, G., Kim, H., Jeong, J., Jung, C., Kim, J., Jeon, G., et al. (2023) · Light Science & Applications · doi:10.1038/s41377-023-01169-4 · Cited by 261
Ishai, Y., & Eyal Kushilevitz, Z. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892118 · Cited by 254
Proactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. M. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266442 · Cited by 254
Genuine Multipartite Einstein-Podolsky-Rosen Steering
He, Q., & Reid, M. D. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.250403 · Cited by 253
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (2002) · International Journal of Information Security · doi:10.1007/s102070100006 · Cited by 253
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 253
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. M. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62225 · Cited by 253
Minimal Codewords and Secret Sharing
Massey, J. L. (1999) · Cited by 249
Asynchronous Multiparty Computation: Theory and Implementation
Damgård, I., Geisler, M., Krøigaard, M., & Nielsen, J. B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00468-1_10 · Cited by 248
Threshold Cryptosystems from Threshold Fully Homomorphic Encryption
Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P., & Sahai, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96884-1_19 · Cited by 248
Image Size Invariant Visual Cryptography
Ito, R., Kuwakado, H., & Tanaka, H. (1999) · Cited by 247
Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
Gennaro, R., Goldfeder, S., & Narayanan, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_9 · Cited by 247
Vadhan, S. (2012) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000010 · Cited by 343
Achieving Efficient and Secure Data Acquisition for Cloud-Supported Internet of Things in Smart Grid
Guan, Z., Li, J., Wu, L., Zhang, Y., Wu, J., & Du, X. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2690522 · Cited by 244
Cui, Q., You, X., Ni, W., Nan, G., Zhang, X., Zhang, J., Lyu, X., Ai, M., Tao, X., Feng, Z., et al. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4337-1 · Cited by 275
Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
Jean, J., Nikolić, I., & Peyrin, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45608-8_15 · Cited by 243
Hierarchical Threshold Secret Sharing
Tassa, T. (2007) · Journal of Cryptology · doi:10.1007/s00145-006-0334-8 · Cited by 243
SPREAD: enhancing data confidentiality in mobile ad hoc networks
Lou, W., Liu, W., & Fang, Y. M. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354662 · Cited by 241
A Survey of How to Use Blockchain to Secure Internet of Things and the Stalker Attack
Jesus, E. F., Chicarino, V. R. L., Albuquerque, C. V. N., & Rocha, A. A. D. A. (2018) · Security and Communication Networks · doi:10.1155/2018/9675050 · Cited by 237
Hiding instances in multioracle queries
Beaver, D., & Joan Feigenbaum, A. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52282-4_30 · Cited by 237
Coercion-Resistant Electronic Elections
Juels, A., Catalano, D., & Jakobsson, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12980-3_2 · Cited by 236
Goldwasser, S. (1997) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/259380.259405 · Cited by 235
Secure Overlay Cloud Storage with Access Control and Assured Deletion
Tang, Y. S., Lee, P. P. C., Lui, J. C. S., & Perlman, R. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2012.49 · Cited by 233
Intrusion tolerance in distributed computing systems
Deswarte, Y., Blain, L., & Fabre, J.-C. (2002) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130780 · Cited by 232
A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding
Lin, H.-Y., & Tzeng, W.-G. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.252 · Cited by 229
On Expected Constant-Round Protocols for Byzantine Agreement
Katz, J. I., & Koo, C. (2006) · Lecture notes in computer science · doi:10.1007/11818175_27 · Cited by 227
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Nishide, T., & Ohta, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-71677-8_23 · Cited by 227
Asynchronous secure computation
Ben-Or, M., Canetti, R., & Goldreich, O. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167109 · Cited by 227
FindU: Privacy-preserving personal profile matching in mobile social networks
Li, M., Cao, N., Yu, S., & Lou, W. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935065 · Cited by 226
A Proof-of-Trust Consensus Protocol for Enhancing Accountability in Crowdsourcing Services
Zou, J., Ye, B., Qu, L., Wang, Y., Orgun, M. A., & Li, L. (2018) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2018.2823705 · Cited by 226
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 226
Self-organized network-layer security in mobile ad hoc networks
Yang, H., Meng, X., & Lu, S. (2002) · Workshop on Wireless Security · doi:10.1145/570681.570683 · Cited by 225
Secret image sharing with smaller shadow images
Wang, R.-Z., & Su, C.-H. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.09.021 · Cited by 224
1Optimal Locally Repairable and Secure Codes for Distributed Storage SystemsPreprint
Rawat, A. S., Koyluoglu, O. O., Silberstein, N., & Vishwanath, S. (2016) · Cited by 224
Privacy-Preserving Federated Learning Using Homomorphic Encryption
Park, J., & Lim, H. (2022) · Applied Sciences · doi:10.3390/app12020734 · Cited by 223
Private information storage (extended abstract)
Ostrovsky, R., & Shoup, V. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258606 · Cited by 223
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
Cramer, R., Damgård, I., & Ishai, Y. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_19 · Cited by 223
Jahid, S., Mittal, P., & Borisov, N. (2011) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1966913.1966970 · Cited by 223
Self-healing key distribution with revocation
Staddon, J., Miner, S., Franklin, M., Balfanz, D., Malkin, M., & Dean, D. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2002.1004375 · Cited by 223
Privacy preserving distributed optimization using homomorphic encryption
Lu, Y., & Zhu, M. (2018) · Automatica · doi:10.1016/j.automatica.2018.07.005 · Cited by 223
Chinese remaindering with errors
Goldreich, O., Ron, D., & Sudan, M. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1109/18.850672 · Cited by 226
A (t,n) multi-secret sharing scheme
Yang, C., Chang, T., & Hwang, M. (2003) · Applied Mathematics and Computation · doi:10.1016/s0096-3003(03)00355-2 · Cited by 222
eHealth Cloud Security Challenges: A Survey
Al-Issa, Y., Ottom, M. A., & Tamrawi, A. (2019) · Journal of Healthcare Engineering · doi:10.1155/2019/7516035 · Cited by 222
Fuzzy Identity-Based Data Integrity Auditing for Reliable Cloud Storage Systems
Li, Y., Yu, Y. H., Min, G., Susilo, W., Ni, J., & Choo, K. R. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2662216 · Cited by 221
Collaborative and secure sharing of healthcare data in multi-clouds
Fabian, B., Ermakova, T., & Junghanns, P. (2015) · Information Systems · doi:10.1016/j.is.2014.05.004 · Cited by 223
sharma (2018) · doi:10.1109/mic.2018.112102519 · Cited by 220
Perfectly-Secure MPC with Linear Communication Complexity
Beerliová-Trubíniová, Z., & Hirt, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_13 · Cited by 220
Efficient and Secure Data Storage Operations for Mobile Cloud Computing.
Zhou, Z., & Huang, D. (2011) · IACR Cryptology ePrint Archive · doi:10.5555/2499406.2499411 · Cited by 220
Yee, B. (1994) · Cited by 220
The first ten years of public-key cryptography
Diffie, W. (1988) · Proceedings of the IEEE · doi:10.1109/5.4442 · Cited by 219
HealthDep: An Efficient and Secure Deduplication Scheme for Cloud-Assisted eHealth Systems
Zhang, Y., Xu, C., Li, H., Yang, K., Zhou, J., & Lin, X. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2832251 · Cited by 219
Distributed Pseudo-random Functions and KDCs
Naor, M., Benny Pinkas, B., & Reingold, O. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_23 · Cited by 218
MIStore: a Blockchain-Based Medical Insurance Storage System
Zhou, L., Wang, L., & Sun, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0996-4 · Cited by 217
k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data
Samanthula, B. K., Elmehdwi, Y., & Jiang, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2364027 · Cited by 217
Optimal-resilience proactive public-key cryptosystems
Frankel, Y., Gemmell, P. S., MACKENZIE, P. D., & Yung, M. M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646127 · Cited by 217
Survivable information storage systems
Wylie, J. J., Bigrigg, M. W., Strunk, J. D., Ganger, G. R., Kiliççöte, H., & Khosla, P. K. (2000) · Computer · doi:10.1109/2.863969 · Cited by 215
Protecting Data Privacy in Private Information Retrieval Schemes
Gertner, Y., Ishai, Y., Eyal Kushilevitz, Z., & Malkin, T. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1689 · Cited by 215
White-Box Traceable Ciphertext-Policy Attribute-Based Encryption Supporting Flexible Attributes
Ning, J., Dong, X., Cao, Z., Wei, L., & Lin, X. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2405905 · Cited by 213
Efficient symmetric multiparty quantum state sharing of an arbitrarym-qubit state
Li, X., Zhou, P., Li, C., Zhou, H.-Y., & Deng, F. (2006) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/39/8/015 · Cited by 212
MobiCloud: Building Secure Cloud Framework for Mobile Computing and Communication
Huang, D., Zhang, X., Kang, M. H., & Luo, J. (2010) · IEEE International Symposium on Service-Oriented System Engineering (SOSE) · doi:10.1109/sose.2010.20 · Cited by 212
Federated Neural Collaborative Filtering
Perifanis, V., & Efraimidis, P. S. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108441 · Cited by 223
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
