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 301–400 of 1,021
Privacy-preserving data aggregation in smart metering systems: an overview
Erkin, Z., Troncoso-Pastoriza, J. R., Lagendijk, R. L., & Pérez‐González, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2228343 · Cited by 211
Secure Network Coding on a Wiretap Network
Cai, N., & Yeung, R. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2090197 · Cited by 211
Distributed Provers with Applications to Undeniable Signatures
Pedersen, T. P. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_20 · Cited by 211
Distributed Point Functions and Their Applications
Gilboa, N., & Ishai, Y. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-55220-5_35 · Cited by 210
Girling, C. G. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233153 · Cited by 209
Jiang, H. Q., Wang, K., Wang, Y., Gao, M., & Zhang, Y. (2016) · IEEE Access · doi:10.1109/access.2016.2580581 · Cited by 209
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052240 · Cited by 208
Froelicher, D., Troncoso-Pastoriza, J. R., Raisaro, J. L., Cuendet, M. A., Sousa, J. S., Cho, H., Berger, B., Fellay, J., & Hubaux, J. (2021) · Nature Communications · doi:10.1038/s41467-021-25972-y · Cited by 226
A Survey on Private Information Retrieval
Gasarch, W. I. (2004) · Cited by 207
Open Problems in Data-Sharing Peer-to-Peer Systems
Daswani, N., García-Molina, H., & Yang, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36285-1_1 · Cited by 207
The case of the fake Picasso: preventing history forgery with secure provenance
Hasan, R., Sion, R., & Winslett, M. (2009) · Cited by 205
Visual secret sharing by random grids revisited
Chen, T., & Tsao, K.-H. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.11.015 · Cited by 204
Privacy-Preserving Attribute-Based Keyword Search in Shared Multi-owner Setting
Miao, Y., Liu, X., Choo, K. R., Deng, R. H., Li, J., Li, H., & Ma, J. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2897675 · Cited by 204
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
Rawat, A. S., Koyluoglu, O. O., Silberstein, N., & Vishwanath, S. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2288784 · Cited by 200
Computation of Cryptographic Keys from Face Biometrics
Goh, A., & Ngo, D. C. L. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45184-6_1 · Cited by 200
Efficient self-healing group key distribution with revocation capability
Liu, D., Ning, P., & Sun, K. (2003) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/948109.948141 · Cited by 200
Prio: Private, Robust, and Scalable Computation of Aggregate StatisticsPreprint
Corrigan-Gibbs, H., & Boneh, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.06255 · Cited by 200
FROST: Flexible Round-Optimized Schnorr Threshold Signatures
Komlo, C., & Goldberg, I. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81652-0_2 · Cited by 199
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
Shoup, V., & Gennaro, R. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0020-9 · Cited by 198
Privacy-Aware Attribute-Based Encryption with User Accountability
Li, J., Ren, K., Zhu, B., & Wan, Z. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04474-8_28 · Cited by 198
Securing Mobile Ad Hoc Networks with Certificateless Public Keys
Zhang, Y., Liu, W., Lou, W., & Fang, Y. M. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.58 · Cited by 198
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
Banawan, K., & Ulukuş, Ş. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2869154 · Cited by 198
Efficient Byzantine-tolerant erasure-coded storage
Goodson, G. R., Wylie, J. J., Ganger, G. R., & Reiter, M. K. (2004) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2004.1311884 · Cited by 197
Sookhak, M., Jabbarpour, M. R., Safa, N. S., & Yu, F. R. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102950 · Cited by 198
Keidar, I., Kokoris-Kogias, E., Naor, O., & Spiegelman, A. (2021) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3465084.3467905 · Cited by 195
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_13 · Cited by 195
Bidirectional quantum secret sharing and secret splitting with polarized single photons
Deng, F., Zhou, H.-Y., & Long, G. L. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.02.001 · Cited by 193
Exposure-Resilient Functions and All-or-Nothing Transforms
Canetti, R., Dodis, Y., Halevi, S., Eyal Kushilevitz, Z., & Sahai, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_33 · Cited by 192
Deng, F., Li, X.-H., Li, C.-Y., Zhou, P., & Zhou, H. (2006) · The European Physical Journal D · doi:10.1140/epjd/e2006-00124-1 · Cited by 192
A Secure Data Deduplication Scheme for Cloud Storage
Staněk, J., Sorniotti, A., Androulaki, E., & Kencl, L. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45472-5_8 · Cited by 192
Side-Channel Resistant Crypto for Less than 2,300 GE
Poschmann, A. Y., Moradi, A., Khoo, K., Lim, C.-W., Wang, H., & Ling, S. (2010) · Journal of Cryptology · doi:10.1007/s00145-010-9086-6 · Cited by 191
Unconditional security of entanglement-based continuous-variable quantum secret sharing
Kogias, I., Xiang, Y., He, Q., & Adesso, G. (2017) · Physical Review A · doi:10.1103/physreva.95.012315 · Cited by 191
Decentralized Federated Learning: A Survey on Security and Privacy
Hallaji, E., Razavi‐Far, R., Saif, M., Wang, B., & Yang, Q. (2024) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2024.3362191 · Cited by 204
Rational Secret Sharing, Revisited
Gordon, S., & Katz, J. I. (2006) · Lecture notes in computer science · doi:10.1007/11832072_16 · Cited by 189
On the power of two-point based sampling
Chor, B., & Goldreich, O. (1989) · Journal of Complexity · doi:10.1016/0885-064x(89)90015-0 · Cited by 189
A cluster-based security architecture for ad hoc networks
Bechler, M., Hof, H., Kraft, D., Pählke, F., & Wolf, L. C. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354661 · Cited by 188
Semiquantum secret sharing using entangled states
Li, Q., Chan, W. H., & Long, D. (2010) · Physical Review A · doi:10.1103/physreva.82.022303 · Cited by 187
Efficient and Privacy-Preserving Outsourced Calculation of Rational Numbers
Liu, X., Choo, K. R., Deng, R. H., Lu, R., & Weng, J. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2536601 · Cited by 187
A Decentralized Public Key Infrastructure with Identity Retention.
Fromknecht, C., Velicanu, D., & Yakoubov, S. (2014) · Cited by 187
Cryptography and Game Theory: Designing Protocols for Exchanging Information
Kol, G., & Naor, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_18 · Cited by 186
Efficient generation of shared RSA keys
Boneh, D., & Franklin, M. (2001) · Journal of the ACM · doi:10.1145/502090.502094 · Cited by 185
Biometrics-based cryptographic key generation
Chang, Y., Zhang, W., & Chen, T. (2005) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme.2004.1394707 · Cited by 185
Improving the Robustness of Private Information Retrieval
Goldberg, I. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.23 · Cited by 184
Scaling ORAM for Secure Computation
Doerner, J., & Shelat, A. A. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133967 · Cited by 184
Evaluating Gradient Inversion Attacks and Defenses in Federated LearningPreprint
Huang, Y., Gupta, S., Song, Z., Li, K., & Arora, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.00059 · Cited by 186
Multipartite Gaussian steering: Monogamy constraints and quantum cryptography applications
Xiang, Y., Kogias, I., Adesso, G., & He, Q. (2017) · Physical Review A · doi:10.1103/physreva.95.010101 · Cited by 183
Sonnino, A., Al-Bassam, M., Bano, S., Meiklejohn, S., & Danezis, G. (2019) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23272 · Cited by 200
Authenticated Group Key Transfer Protocol Based on Secret Sharing
Harn, L., & Lin, C. (2010) · IEEE Transactions on Computers · doi:10.1109/tc.2010.40 · Cited by 182
Jakobsson, M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054145 · Cited by 182
Decomposition constructions for secret-sharing schemes
Stinson, D. R. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.272461 · Cited by 182
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Damgård, I., Ishai, Y., & Krøigaard, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_23 · Cited by 181
Disappearing Cryptography: Information Hiding: Steganography and Watermarking
Wayner, P. (2008) · Medical Entomology and Zoology · Cited by 180
MASK: anonymous on-demand routing in mobile ad hoc networks
Zhang, Y., Liu, W., Lou, W., & Fang, Y. M. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1687761 · Cited by 180
LEDS: Providing Location-Aware End-to-End Data Security in Wireless Sensor Networks
Ren, K., Lou, W., & Zhang, Y. (2006) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2006.303 · Cited by 180
BeeKeeper: A Blockchain-Based IoT System With Secure Storage and Homomorphic Computation
Zhou, L., Wang, L., Sun, Y., & Lv, P. (2018) · IEEE Access · doi:10.1109/access.2018.2847632 · Cited by 182
Preserving data privacy in machine learning systems
Mestari, S. Z. E., Lenzini, G., & Demirci, H. (2023) · Computers & Security · doi:10.1016/j.cose.2023.103605 · Cited by 195
Efficient multi-secret image sharing based on Boolean operations
Chen, T., & Wu, C.-S. (2010) · Signal Processing · doi:10.1016/j.sigpro.2010.06.012 · Cited by 179
Network coding and error correction
Cai, N., & Yeung, R. W. (2003) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2002.1115432 · Cited by 179
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Damgård, I., & Ishai, Y. (2005) · Lecture notes in computer science · doi:10.1007/11535218_23 · Cited by 178
Control Cloud Data Access Privilege and Anonymity With Fully Anonymous Attribute-Based Encryption
Jung, T., Li, X., Wan, Z., & Wan, M. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2014.2368352 · Cited by 176
Experimental Demonstration of Four-Party Quantum Secret Sharing
Gaertner, S., Kurtsiefer, C., Bourennane, M., & Weinfurter, H. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.020503 · Cited by 175
Identity-Based Threshold Decryption
Baek, J., & Yuliang Zheng, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24632-9_19 · Cited by 175
A Lightweight Privacy-Preserving CNN Feature Extraction Framework for Mobile Sensing
Huang, K., Liu, X., Fu, S., Guo, D., & Xu, M. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2913362 · Cited by 175
Secure and efficient key management in mobile ad hoc networks
Wu, B., Wu, J., Fernández, E. B., Ilyas, M., & Magliveras, S. S. (2005) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2005.07.008 · Cited by 174
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lindell, Y., & Benny Pinkas, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_20 · Cited by 174
Random oracles in constantipole
Cachin, C., Kursawe, K., & Shoup, V. (2000) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/343477.343531 · Cited by 173
Secure Two-party Threshold ECDSA from ECDSA Assumptions
Doerner, J., Kondi, Y., Lee, E., & Shelat, A. A. (2018) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2018.00036 · Cited by 173
Hiding Classical Data in Multipartite Quantum States
Eggeling, T., & Werner, R. F. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.097905 · Cited by 172
Quantum computers and quantum coherence
Divincenzo, D. P., & Loss, D. (1999) · Journal of Magnetism and Magnetic Materials · doi:10.1016/s0304-8853(99)00315-7 · Cited by 176
Higher Order Masking of Look-Up Tables
Coron, J.-S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-55220-5_25 · Cited by 171
AONT-RS: blending security and performance in dispersed storage systems
Resch, J. K., & Plank, J. S. (2011) · doi:10.5555/1960475.1960489 · Cited by 170
Attribute-based encryption schemes with constant-size ciphertexts
Attrapadung, N., Herranz, J., Laguillaumie, F., Libert, B., de Panafieu, É., & Ràfols, C. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.12.004 · Cited by 170
Biometric Systems: Privacy and Secrecy Aspects
Ignatenko, T., & Willems, F. M. J. (2009) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2009.2033228 · Cited by 170
Zhang, Y., Xu, C., Ni, J., Li, H., & Shen, X. (2019) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2019.2923222 · Cited by 170
FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated LearningPreprint
Kadhe, S., Rajaraman, N., Koyluoglu, O. O., & Ramchandran, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.11248 · Cited by 223
Kanan, H. R., & Nazeri, B. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.04.022 · Cited by 169
Database Management as a Service: Challenges and Opportunities
Agrawal, D., Abbadi, A. E., Emekçi, F., & Metwally, A. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.151 · Cited by 169
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
Zhang, J., Xie, T., Zhang, Y., & Song, D. (2020) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40000.2020.00052 · Cited by 169
Naor, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_31 · Cited by 169
Frankel, Y., Gemmell, P. S., MACKENZIE, P. D., & Yung, M. M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052254 · Cited by 169
Mediated Ciphertext-Policy Attribute-Based Encryption and Its Application
Ibraimi, L., Petković, M., Nikova⋆, S., Hartel, P., & Jonker, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10838-9_23 · Cited by 168
Threshold and identity-based key management and authentication for wireless ad hoc networks
Deng, H., Mukherjee, A., & Agrawal, D. P. (2004) · International Conference on Information Technology: Coding and Computing (ITCC) · doi:10.1109/itcc.2004.1286434 · Cited by 168
Privacy-Preserving Federated Deep Learning with Irregular Users
Xu, G., Li, H., Zhang, Y., Xu, S., Ning, J., & Deng, R. H. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3005909 · Cited by 172
Desmedt, Y. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1_47 · Cited by 168
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Chen, H., & Cramer, R. (2006) · Lecture notes in computer science · doi:10.1007/11818175_31 · Cited by 168
Camenisch, J. L., & Damgård, I. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_25 · Cited by 168
Maram, D., Malvai, H., Zhang, F., Jean-Louis, N., Frolov, A., Kell, T., Lobban, T., Moy, C., Juels, A., & Miller, A. K. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00038 · Cited by 178
Smart and collaborative industrial IoT: A federated learning and data space approach
Farahani, B., & Monsefi, A. K. (2023) · Digital Communications and Networks · doi:10.1016/j.dcan.2023.01.022 · Cited by 167
Solving Simultaneous Modular Equations of Low Degree
Håstad, J. (1988) · SIAM Journal on Computing · doi:10.1137/0217019 · Cited by 166
An image-sharing method with user-friendly shadow images
Thien, C.-C., & Lin, J. (2003) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.819176 · Cited by 166
Experimental demonstration of graph-state quantum secret sharing
Bell, B. A., Markham, D., Herrera-Martí, D. A., Marin, A., Wadsworth, W. J., Rarity, J. G., & Tame, M. S. (2014) · Nature Communications · doi:10.1038/ncomms6480 · Cited by 155
Privacy-preserving cooperative scientific computations
Du, W. K., & Atallah, M. J. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930152 · Cited by 165
Counting-based secret sharing technique for multimedia applications
Gutub, A. A. A., Aljuaid, N., & Khan, E. A. (2017) · Multimedia Tools and Applications · doi:10.1007/s11042-017-5293-6 · Cited by 164
Networks without user observability
Pfitzmann, A., & Waidner, M. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90087-3 · Cited by 164
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
Benaloh, J. C. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_19 · Cited by 164
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
Stinson, D. R. (1997) · Designs Codes and Cryptography · doi:10.1023/a:1008268610932 · Cited by 164
Optimizing resource consumption, operation complexity and efficiency in quantum-state sharing
Yuan, H., Liu, Y., Zhang, W., & Zhang, Z. (2008) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/41/14/145506 · Cited by 163
Threshold ECDSA from ECDSA Assumptions: The Multiparty Case
Doerner, J., Kondi, Y., Lee, E., & Shelat, A. A. (2019) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2019.00024 · Cited by 163
Integrating Artificial Intelligence and Wearable IoT System in Long-Term Care Environments
Wang, W., & Hsu, W.-S. (2023) · Sensors · doi:10.3390/s23135913 · Cited by 163
A systematic review of federated learning: Challenges, aggregation methods, and development tools
Guendouzi, S. B., Ouchani, S., Assaad, H. E., & Zaher, M. E. (2023) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2023.103714 · Cited by 176
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
