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 501–600 of 1,021
The round complexity of verifiable secret sharing and secure multicast
Gennaro, R., Ishai, Y., Kushilevitz, E., & Rabin, T. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380853 · Cited by 137
Preventing history forgery with secure provenance
Hasan, R., Sion, R., & Winslett, M. (2009) · ACM Transactions on Storage · doi:10.1145/1629080.1629082 · Cited by 136
Scalable Secure Multiparty Computation
Damgård, I., & Ishai, Y. (2006) · Lecture notes in computer science · doi:10.1007/11818175_30 · Cited by 136
Bellare, M., & Goldwasser, S. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266439 · Cited by 136
Secure data processing framework for mobile cloud computing
Huang, D., Zhou, Z., Xu, L., Xing, T., & Zhong, Y. (2011) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2011.5928886 · Cited by 135
Secure and Efficient Data Communication Protocol for Wireless Body Area Networks
Hu, C., Li, H., Huo, Y., Xiang, T., & Liao, X. (2016) · IEEE Transactions on Multi-Scale Computing Systems · doi:10.1109/tmscs.2016.2525997 · Cited by 135
On Quorum Controlled Asymmetric Proxy Re-encryption
Jakobsson, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49162-7_9 · Cited by 135
Privacy Preserving Policy-Based Content Sharing in Public Clouds
Nabeel, M., Shang, N., & Bertino, E. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.180 · Cited by 134
Differential Computation Analysis: Hiding Your White-Box Designs is Not Enough
Bos, J. W., Hubain, C., Michiels, W., & Teuwen, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53140-2_11 · Cited by 134
File System Design with Assured Delete
Perlman, R. (2006) · International IEEE Security in Storage Workshop (SISW) · doi:10.1109/sisw.2005.5 · Cited by 134
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Fouque, P.-A., & Pointcheval, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_21 · Cited by 134
Privacy Protection and Data Security in Cloud Computing: A Survey, Challenges, and Solutions
Sun, P. J. (2019) · IEEE Access · doi:10.1109/access.2019.2946185 · Cited by 133
PPO-CPQ: A Privacy-Preserving Optimization of Clinical Pathway Query for E-Healthcare Systems
Zhang, M., Chen, Y., & Susilo, W. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3007518 · Cited by 133
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation
Asharov, G., & Lindell, Y. (2015) · Journal of Cryptology · doi:10.1007/s00145-015-9214-4 · Cited by 133
Cryptographic Protocols Provably Secure Against Dynamic Adversaries
Beaver, D., & Haber, S. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_26 · Cited by 133
How to Break a Practical MIX and Design a New One
Desmedt, Y., & Kurosawa, K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_39 · Cited by 133
Algesheimer, J., Camenisch, J. L., & Shoup, V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_27 · Cited by 133
Covering and Secret Sharing with Linear Codes
Ding, C., & Yuan, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45066-1_2 · Cited by 132
An Anti-Quantum Transaction Authentication Approach in Blockchain
Yin, W., Wen, Q., Li, W., Zhang, H., & Jin, Z. (2018) · IEEE Access · doi:10.1109/access.2017.2788411 · Cited by 132
Building blocks of sharding blockchain systems: Concepts, approaches, and open problems
Liu, Y., Liu, J., Salles, M. A. V., Zhang, Z., Li, T., Hu, B., Henglein, F., & Lu, R. (2022) · Computer Science Review · doi:10.1016/j.cosrev.2022.100513 · Cited by 138
Models and Measures for Correlation in Cyber-Insurance
Böhme, R., & Kataria, G. (2006) · Cited by 132
A Survey of Self-Sovereign Identity Ecosystem
Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131
“In 1979, Shamir [123] and Blakely [124] proposed two variations of threshold-based secret sharing schemes. 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.”
BackgroundInfluentialInvertible secret image sharing with steganography
Lin, P.-Y., & Chan, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.01.019 · Cited by 131
Hu, C., Cheng, X., Zhang, F., Wu, D., Liao, X., & Chen, D. (2013) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2013.6567031 · Cited by 131
Quantum-Secure Message Authentication Codes
Boneh, D., & Zhandry, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_35 · Cited by 138
Wei, L., Cui, J., Xu, Y., Cheng, J., & Zhong, H. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.3040876 · Cited by 131
Blockchain Consensus: An Overview of Alternative Protocols
Oyinloye, D. P., Teh, J. S., Jamil, N., & Alawida, M. (2021) · Symmetry · doi:10.3390/sym13081363 · Cited by 139
VerSA: Verifiable Secure Aggregation for Cross-Device Federated Learning
Hahn, C., Kim, H.-D., Kim, M., & Hur, J. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3126323 · Cited by 135
Fairness and privacy preserving in federated learning: A survey
Rafi, T. H., Noor, F. A., Hussain, T., & Chae, D. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.102198 · Cited by 138
Multiple assignment scheme for sharing secret
Ito, M., Saito, A., & Nishizeki, T. (1993) · Journal of Cryptology · doi:10.1007/bf02620229 · Cited by 131
On monotone formula closure of SZK
Santis, A. D., Crescenzo, G. D., Persiano, G., & Yung, M. M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365745 · Cited by 131
Games for exchanging information
Kol, G., & Naor, M. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374437 · Cited by 130
Zero-Knowledge Proofs from Secure Multiparty Computation
Ishai, Y., Eyal Kushilevitz, Z., Ostrovsky, R., & Sahai, A. (2009) · SIAM Journal on Computing · doi:10.1137/080725398 · Cited by 130
Body Area Network Security: A Fuzzy Attribute-Based Signcryption Scheme
Hu, C., Zhang, N., Li, H., Cheng, X., & Liao, X. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.sup.0513004 · Cited by 130
Low-Exponent RSA with Related Messages
Coppersmith, D., Franklin, M., Patarin, J., & Reiter, M. K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_1 · Cited by 130
Privacy-preserving Heterogeneous Federated Transfer Learning
Gao, D., Liu, Y., Huang, A., Ju, C., Yu, H., & Yang, Q. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9005992 · Cited by 133
Separable Linkable Threshold Ring Signatures
Tsang, P. P., Wei, V. K., Chan, T. K., Au, M. H., Liu, J. K., & Wong, D. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30556-9_30 · Cited by 129
Tesseract: a 4D network control plane
Yan, H., Maltz, D. A., Ng, T. S. E., Gogineni, H., Zhang, H., & Cai, Z. (2007) · Cited by 129
Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes
Ibraimi, L., Tang, Q., Hartel, P., & Jonker, W. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00843-6_1 · Cited by 129
Robust efficient distributed RSA-key generation
Frankel, Y., MACKENZIE, P. D., & Yung, M. M. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276882 · Cited by 129
Secure and Privacy-Aware Cloud-Assisted Video Reporting Service in 5G-Enabled Vehicular Networks
Eiza, M. H., Ni, Q., & Shi, Q. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2541862 · Cited by 128
Attribute-based data access control in mobile cloud computing: Taxonomy and open issues
Sookhak, M., Yu, F. R., Khan, M. K., Xiang, Y., & Buyya, R. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.08.018 · Cited by 128
From distributed machine learning to federated learning: In the view of data privacy and security
Shen, S., Zhu, T., Wu, D., Wang, W., & Zhou, W. (2020) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.6002 · Cited by 134
On the utility of distributed cryptography in P2P and MANETs: the case of membership control
Narasimha, M., Tsudik, G., & Yi, J. H. (2004) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2003.1249783 · Cited by 128
Jakobsson, M. (1999) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/301308.301333 · Cited by 128
Secret sharing system using (k, L, n) threshold scheme
Yamamoto, H. (1986) · Electronics and Communications in Japan (Part I Communications) · doi:10.1002/ecja.4410690906 · Cited by 127
Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
Prouff, E., & Roche, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_5 · Cited by 127
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lindell, Y., & Benny Pinkas, B. (2011) · Journal of Cryptology · doi:10.1007/s00145-011-9107-0 · Cited by 127
Secure Computation from Random Error Correcting Codes
Chen, H., Cramer, R., Goldwasser, S., de Haan, R., & Vaikuntanathan, V. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72540-4_17 · Cited by 127
Storing Shared Data on the Cloud via Security-Mediator
Wang, B., Chow, S. S. M., Li, M., & Li, H. (2013) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2013.60 · Cited by 126
CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning
So, J., Güler, B., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3053220 · Cited by 128
How to share a continuous-variable quantum secret by optical interferometry
Tyc, T., & Sanders, B. C. (2002) · Physical Review A · doi:10.1103/physreva.65.042310 · Cited by 127
Computer security strength and risk: a quantitative approach
Smith, M. D., & Schechter, S. (2004) · Cited by 126
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Faust, S., Rabin, T., Reyzin, L., Tromer, E., & Vaikuntanathan, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_7 · Cited by 125
An efficient quantum secret sharing scheme with Einstein–Podolsky–Rosen pairs
Deng, F., Long, G. L., & Zhou, H.-Y. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.04.007 · Cited by 125
Efficient high-capacity quantum secret sharing with two-photon entanglement
Deng, F., Li, X., & Zhou, H.-Y. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.10.066 · Cited by 125
Two-Phase Multi-Party Computation Enabled Privacy-Preserving Federated Learning
Kanagavelu, R., Li, Z., Samsudin, J., Yang, Y., Yang, F., Goh, R. S. M., Cheah, M., Wiwatphonthana, P., Akkarajitsakul, K., & Wangz, S. (2020) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid49817.2020.00-52 · Cited by 125
Electronic auctions with private bids
Harkavy, M. D., Tygar, J. D., & Kikuchi, H. (1998) · Cited by 125
Park, T., & Shin, K. G. (2004) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1015047.1015056 · Cited by 125
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
Desmedt, Y., Frankel, Y., & Yung, M. M. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263476 · Cited by 125
Efficient Secure Multi-party Computation
Hirt, M., Maurer, U. M., & Przydatek, B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_12 · Cited by 124
Ning, J., Cao, Z., Dong, X., & Wei, L. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2608343 · Cited by 123
Volgushev, N., Schwarzkopf, M., Getchell, B., Varia, M., Lapets, A., & Azer Bestavros, C. (2019) · European Conference on Computer Systems · doi:10.1145/3302424.3303982 · Cited by 123
Secure Data Aggregation of Lightweight E-Healthcare IoT Devices With Fair Incentives
Tang, W., Ren, J., Kun, D., & Zhang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2923261 · Cited by 123
Dyad : a system for using physically secure coprocessors
Tygar, J. D., & Yee, B. (2018) · doi:10.1184/r1/6604994 · Cited by 123
Stinson, D. R., & Strobl, R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-47719-5_33 · Cited by 122
Trust Issues for Vehicular Ad Hoc Networks
Wex, P., Breuer, J., Held, A., Leinmüller, T., & Delgrossi, L. (2008) · IEEE Vehicular Technology Conference · doi:10.1109/vetecs.2008.611 · Cited by 122
Identity-based authentication scheme for the Internet of Things
Salman, O., Abdallah, S., Elhajj, I. H., Chehab, A., & Kayssi, A. I. (2016) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2016.7543884 · Cited by 122
A Length-Flexible Threshold Cryptosystem with Applications
Damgård, I., & Jurik, M. J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45067-x_30 · Cited by 122
Efficient Construction of (Distributed) Verifiable Random Functions
Dodis, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_1 · Cited by 122
Waldman, M., & Mazières, D. (2001) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/501983.502002 · Cited by 122
CDStore: Toward Reliable, Secure, and Cost-Efficient Cloud Storage via Convergent Dispersal
Li, M., Qin, C., Li, J., & Lee, P. P. C. (2016) · IEEE Internet Computing · doi:10.1109/mic.2016.45 · Cited by 121
A Survey of Secure Data Deduplication Schemes for Cloud Storage Systems
Shin, Y., Koo, D., & Hur, J. (2017) · ACM Computing Surveys · doi:10.1145/3017428 · Cited by 121
Zhang, Y., Xu, C., Li, H., Yang, K., Cheng, N., & Shen, X. (2020) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.2975792 · Cited by 121
Generalized quantum secret sharing
Singh, S. K., & Srikanth, R. (2005) · Physical Review A · doi:10.1103/physreva.71.012328 · Cited by 121
Efficient Rational Secret Sharing in Standard Communication Networks
Fuchsbauer, G., Katz, J. I., & Naccache, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_25 · Cited by 120
Progressive Visual Cryptography With Unexpanded Shares
Hou, Y., & Quan, Z.-Y. (2011) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2011.2106291 · Cited by 120
BDFL: A Byzantine-Fault-Tolerance Decentralized Federated Learning Method for Autonomous Vehicle
Chen, J.-H., Chen, M.-R., Zeng, G., & Weng, J. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3102121 · Cited by 130
Zhang, Z. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.11.051 · Cited by 120
User 4XXXXX9: Anonymizing Query Logs
Adar, E. (2007) · Cited by 120
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
Damgård, I., Ishai, Y., Krøigaard, M., Nielsen, J. B., & Smith, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_14 · Cited by 119
Xu, L., Wu, X., & Zhang, X. (2012) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2414456.2414507 · Cited by 119
Biometric Based Cryptographic Key Generation From Faces
Chen, B., & Chandran, V. (2007) · QUT ePrints (Queensland University of Technology) · Cited by 119
BSAS: A Blockchain-Based Trustworthy and Privacy-Preserving Speed Advisory System
Li, J., Li, S., Cheng, L., Liu, Q., Pei, J., & Wang, S. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3189410 · Cited by 119
Wang, R.-Z., & Shyu, S. J. (2007) · Signal Processing Image Communication · doi:10.1016/j.image.2006.12.012 · Cited by 119
Continuous-variable quantum-state sharing via quantum disentanglement
Lance, A. M., Symul, T., Bowen, W. P., Sanders, B. C., Tyc, T., Ralph, T. C., & Lam, P. K. (2005) · Physical Review A · doi:10.1103/physreva.71.033814 · Cited by 119
Li, C.-M., Hwang, T., & Lee, N.-Y. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053435 · Cited by 119
Digital payment systems with passive anonymity-revoking trustees
Camenisch, J. L., Maurer, U. M., & Stadler, M. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61770-1_26 · Cited by 119
Efficient Privacy Preserving in IoMT With Blockchain and Lightweight Secret Sharing
Li, C., Dong, M., Xin, X., Li, J., Chen, X.-B., & Ota, K. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3296595 · Cited by 118
Efficient Random Route Mutation considering flow and network constraints
Duan, Q., Al-Shaer, E. S., & Jafarian, J. H. (2013) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2013.6682715 · Cited by 118
GASP Codes for Secure Distributed Matrix Multiplication
D’Oliveira, R. G. L., Rouayheb, S. E., & Karpuk, D. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849446 · Cited by 118
Privacy-Preserving Smart Parking System Using Blockchain and Private Information Retrieval
Amiri, W. A., Baza, M., Banawan, K., Mahmoud, M. M. E. A., Alasmary, W., & Akkaya, K. (2019) · International Conference on Smart Applications, Communications and Networking (SmartNets) · doi:10.1109/smartnets48225.2019.9069783 · Cited by 118
Intrusion-Resilient Secret Sharing
Dziembowski, S., & Pietrzak, K. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.4389495 · Cited by 118
Dynamic quantum secret sharing
Hsu, J.-L., Chong, S., Hwang, T., & Tsai, C. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0380-0 · Cited by 117
Privacy-Preserving Artificial Intelligence Techniques in Biomedicine
Torkzadehmahani, R., Nasirigerdeh, R., Blumenthal, D. B., Kacprowski, T., List, M., Matschinske, J., Späth, J., Wenke, N. K., & Baumbach, J. (2022) · Methods of Information in Medicine · doi:10.1055/s-0041-1740630 · Cited by 126
ELSA: Secure Aggregation for Federated Learning with Malicious Actors
Rathee, M., Shen, C., Wagh, S., & Popa, R. A. (2023) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46215.2023.10179468 · Cited by 133
Zhou, L., Schneider, F. B., & van Renesse, R. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1085126.1085127 · Cited by 117
Robust routing in wireless ad hoc networks
Lee, S., Han, B., & Shin, M. (2003) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2002.1039714 · Cited by 117
PPM-HDA: Privacy-Preserving and Multifunctional Health Data Aggregation With Fault Tolerance
Han, S., Zhao, S., Li, Q., Ju, C., & Zhou, W. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2472369 · Cited by 116
Signcryption and its applications in efficient public key solutions
Yuliang Zheng, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0030430 · Cited by 116
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
