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 101–200 of 1,021
Protecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Eyal Kushilevitz, Z., & Malkin, T. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276723 · Cited by 449
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture notes in computer science · doi:10.1007/11681878_15 · Cited by 447
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1102199.1102213 · Cited by 446
Robust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_31 · Cited by 445
Graph states for quantum secret sharing
Markham, D., & Sanders, B. C. (2008) · Physical Review A · doi:10.1103/physreva.78.042309 · Cited by 445
Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement
Deng, F., Li, C., Li, Y., Zhou, H.-Y., & Wang, Y. (2005) · Physical Review A · doi:10.1103/physreva.72.022338 · Cited by 448
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
Cachin, C., Kursawe, K., & Shoup, V. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0318-0 · Cited by 439
The Capacity of Private Information Retrieval
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689028 · Cited by 437
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (2006) · Journal of Cryptology · doi:10.1007/s00145-006-0347-3 · Cited by 435
Privacy-Preserving Solutions for Blockchain: Review and Challenges
Bernal Bernabe, J., Canovas, J. L., Hernandez-Ramos, J. L., Torres Moreno, R., & Skarmeta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2950872 · Cited by 459
“Another approach is called Secret Sharing, created independently by authors of [131] and [132].”
BackgroundSecuring wireless sensor networks: a survey
Zhou, Y., Fang, Y. M., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 428
Zero-knowledge from secure multiparty computation
Ishai, Y., Eyal Kushilevitz, Z., Ostrovsky, R., & Sahai, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250794 · Cited by 425
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_28 · Cited by 424
When private set intersection meets big data
Dong, C., Chen, L., & Wen, Z. A. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516701 · Cited by 424
Thapa, C., & Camtepe, S. A. (2020) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 449
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
Buchman, E. (2016) · The Atrium (University of Guelph) · Cited by 424
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Araki, T., Furukawa, J., Lindell, Y., Nof, A., & Ohara, K. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978331 · Cited by 413
The LSD Broadcast Encryption Scheme
Halevy, D., & Adi Shamir, Z. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_4 · Cited by 412
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73489-5_2 · Cited by 408
Key-Insulated Public Key Cryptosystems
Dodis, Y., Katz, J. I., Xu, S., & Yung, M. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_5 · Cited by 408
Kim, S., Park, S., & Won, D. (1997) · Lecture notes in computer science · doi:10.1007/bfb0028478 · Cited by 407
Perfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 405
Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
Carlet, C., Ding, C., & Yuan, J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847722 · Cited by 401
Privacy preservation in federated learning: An insightful survey from the GDPR perspective
Truong, N., Sun, K., Wang, S., Guitton, F., & Guo, Y. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102402 · Cited by 399
How to share a secret with cheaters
Tompa, M., & Woll, H. (1989) · Journal of Cryptology · doi:10.1007/bf02252871 · Cited by 397
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 409
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A. T., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 396
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_37 · Cited by 392
Masking against Side-Channel Attacks: A Formal Security Proof
Prouff, E., & Rivain, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_9 · Cited by 391
An explication of secret sharing schemes
Stinson, D. R. (1992) · Designs Codes and Cryptography · doi:10.1007/bf00125203 · Cited by 386
Boyle, E., Gilboa, N., & Ishai, Y. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978429 · Cited by 386
Prochlo: Strong Privacy for Analytics in the Crowd
Bittau, A., Erlingsson, Ú., Maniatis, P., Mironov, I., Raghunathan, A., Lie, D., Rudominer, M., Kode, U., Tinnes, J., & Seefeld, B. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132769 · Cited by 378
“First, recall the basic idea behind Shamir secret sharing [68]: t-secret sharing splits a secret s in a field F into arbitrary shares s1, s2, .”
BackgroundHomomorphic Encryption-Based Privacy-Preserving Federated Learning in IoT-Enabled Healthcare System
Zhang, L., Xu, J., Vijayakumar, P., Sharma, P. K., & Ghosh, U. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3185327 · Cited by 376
Secure attribute-based systems
Pirretti, M., Traynor, P., McDaniel, P. D., & Waters, B. R. (2006) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1180405.1180419 · Cited by 373
Towards secure mobile cloud computing: a survey
Khan, A. N., Mat Kiah, M. L., Khan, S. U., & Madani, S. A. (2013) · Future Generation Computer Systems · doi:10.1016/j.future.2012.08.003 · Cited by 368
Blakley, G. R., & Meadows, C. A. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_20 · Cited by 364
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks
Sun, J., Zhang, C., Zhang, Y., & Fang, Y. M. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.14 · Cited by 364
Self-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2002.1021731 · Cited by 363
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_9 · Cited by 360
A simple parallel algorithm for the maximal independent set problem
Luby, M. G. (1985) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/22145.22146 · Cited by 385
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2014) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
Krawczyk, H. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_12 · Cited by 355
Biscotti: A blockchain system for private and secure federated learning
Shayan, M., Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3044223 · Cited by 354
Optical secret sharing with cascaded metasurface holography
Georgi, P., Wei, Q., Sain, B., Schlickriede, C., Wang, Y., Huang, L., & Zentgraf, T. (2021) · Science Advances · doi:10.1126/sciadv.abf9718 · Cited by 350
Squealing Euros: Privacy Protection in RFID-Enabled Banknotes
Juels, A., & Pappu, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45126-6_8 · Cited by 348
Fair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. A. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_6 · Cited by 345
Vanish: increasing data privacy with self-destructing data
Geambasu, R., Kohno, T., Levy, A. A., & Levy, H. M. (2009) · Cited by 344
A survey on peer-to-peer key management for mobile ad hoc networks
Merwe, J. V. D., Dawoud, D., & McDonald, S. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216371 · Cited by 344
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Zhu, S., Xu, S., Setia, S. K., & Jajodia, S. (2004) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2003.1249782 · Cited by 342
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 358
Optimal encryption of quantum bits
Boykin, P. O., & Roychowdhury, V. (2003) · Physical Review A · doi:10.1103/physreva.67.042317 · Cited by 354
Distributed computing meets game theory
Abraham, I., Dolev, D., Gonen, R., & Halpern, J. (2006) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1146381.1146393 · Cited by 339
One-way functions are essential for complexity based cryptography
Impagliazzo, R., & Luby, M. G. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63483 · Cited by 338
Shim, K. (2012) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2012.2186992 · Cited by 338
Blockchain-Based Federated Learning for Securing Internet of Things: A Comprehensive Survey
Issa, W., Moustafa, N., Turnbull, B., Sohrabi, N., & Tari, Z. (2022) · ACM Computing Surveys · doi:10.1145/3560816 · Cited by 347
Key Homomorphic PRFs and Their Applications
Boneh, D., Lewi, K., Montgomery, H. W., & Raghunathan, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_23 · Cited by 337
Lindell, Y. (2020) · Communications of the ACM · doi:10.1145/3387108 · Cited by 336
Boyle, E., Gilboa, N., & Ishai, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46803-6_12 · Cited by 336
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 363
Selective scalable secret image sharing with verification
Lee, J.-S., & Chen, Y.-R. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-015-3011-9 · Cited by 333
Schwarz, M., Lipp, M., Moghimi, D., Bulck, J. V., Stecklina, J., Prescher, T., & Gruss, D. (2019) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3319535.3354252 · Cited by 333
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 332
CrypTFlow2: Practical 2-Party Secure Inference
Rathee, D., Rathee, M., Kumar, N., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R. (2020) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3372297.3417274 · Cited by 354
How to share a function securely
Santis, A. D., Desmedt, Y., Frankel, Y., & Yung, M. M. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195405 · Cited by 331
Bessani, A., Correia, M. P., Quaresma, B., André, F., & Sousa, P. (2013) · ACM Transactions on Storage · doi:10.1145/2535929 · Cited by 330
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Zhang, Y., Liu, W., Lou, W., & Fang, Y. M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861382 · Cited by 327
Sharing Decryption in the Context of Voting or Lotteries
Fouque, P.-A., Poupard, G., & Stern, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45472-1_7 · Cited by 326
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319720 · Cited by 326
Lagrange Coded Computing: Optimal Design for Resiliency, Security and PrivacyPreprint
Yu, Q., Li, S., Raviv, N., Kalan, S. M. M., Soltanolkotabi, M., & Avestimehr, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.00939 · Cited by 335
Rational secret sharing and multiparty computation
Halpern, J. Y., & Teague, V. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007447 · Cited by 323
Bessani, A., Correia, M. P., Quaresma, B., André, F., & Sousa, P. (2011) · European Conference on Computer Systems · doi:10.1145/1966445.1966449 · Cited by 322
Machine Learning for Healthcare Wearable Devices: The Big Picture
Sabry, F., Eltaras, T., Labda, W., Alzoubi, K., & Malluhi, Q. (2022) · Journal of Healthcare Engineering · doi:10.1155/2022/4653923 · Cited by 321
Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud
Wang, B., Li, B., & Li, H. (2014) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2013.2295611 · Cited by 321
KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage
Li, J., Lin, X., Zhang, Y., & Han, J. (2016) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2542813 · Cited by 321
Threshold Ring Signatures and Applications to Ad-hoc Groups
Bresson, E., Stern, J., & Szydlo, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_30 · Cited by 319
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3054610 · Cited by 318
Security of public-key cryptosystems based on Chebyshev polynomials
Bergamo, P., D’Arco, P., Santis, A. D., & Kocarev, L. (2005) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2005.851701 · Cited by 317
Security and privacy protection in cloud computing: Discussions and challenges
Sun, P. J. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102642 · Cited by 316
Secure and practical outsourcing of linear programming in cloud computing
Wang, C., Ren, K., & Wang, J. S. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935305 · Cited by 317
Byzantine-Resilient Secure Federated Learning
So, J., Guler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3041404 · Cited by 313
Efficient Trace and Revoke Schemes
Naor, M., & Benny Pinkas, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45472-1_1 · Cited by 312
Fast asynchronous Byzantine agreement with optimal resilience
Canetti, R., & Rabin, T. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167105 · Cited by 312
Improvements of image sharing with steganography and authentication
Yang, C., Chen, T.-S., Yu, K. H., & Wang, C.-C. (2007) · Journal of Systems and Software · doi:10.1016/j.jss.2006.11.022 · Cited by 311
Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches
Nikova⋆, S., Rijmen, V., & Schläffer, M. (2010) · Journal of Cryptology · doi:10.1007/s00145-010-9085-7 · Cited by 310
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
Ding, K., & Ding, C. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2473861 · Cited by 308
Secret sharing schemes from three classes of linear codes
Yuan, J., & Ding, C. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860412 · Cited by 305
Practical multi-candidate election system
Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., & Poupard, G. (2001) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/383962.384044 · Cited by 304
How to (Really) Share a Secret
Simmons, G. J. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_30 · Cited by 301
Scalable Bias-Resistant Distributed Randomness
Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., & Ford, B. (2017) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2017.45 · Cited by 300
EnclaveDB: A Secure Database Using SGX
Priebe, C., Vaswani, K., & Costa, M. (2018) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2018.00025 · Cited by 300
Franco, P. (2014) · Wiley eBooks · doi:10.1002/9781119019138 · Cited by 300
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture notes in computer science · doi:10.1007/11602897_35 · Cited by 299
The Capacity of Robust Private Information Retrieval With Colluding Databases
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777490 · Cited by 298
Desmedt, Y. (1994) · European Transactions on Telecommunications · doi:10.1002/ett.4460050407 · Cited by 297
Functional Encryption with Bounded Collusions via Multi-party Computation
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_11 · Cited by 296
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 295
A Ciphertext-Policy Attribute-Based Encryption Scheme with Constant Ciphertext Length
Emura, K., Miyaji, A., Nomura, A., Omote, K., & Soshi, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00843-6_2 · Cited by 294
(2010) · Cited by 291
VFL: A Verifiable Federated Learning With Privacy-Preserving for Big Data in Industrial IoT
Fu, A., Zhang, X., Xiong, N. N., Gao, Y., Wang, H., & Zhang, J. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3036166 · Cited by 297
Cloud Computing Security: From Single to Multi-clouds
AlZain, M. A., Pardede, E., Soh, B., & Thom, J. A. (2012) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2012.153 · Cited by 289
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
