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 901–1,000 of 1,021
Multiparty quantum secret splitting and quantum state sharing
Deng, F., Li, X., Li, C., Zhou, P., & Zhou, H.-Y. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.01.054 · Cited by 80
Current Research Topics on Galois Geometry
Storme, L., & Beule, J. D. (2011) · Ghent University Academic Bibliography (Ghent University) · Cited by 80
Towards Designing a Trusted Routing Solution in Mobile Ad Hoc Networks
Ghosh, T., Pissinou, N., & Makki, S. A. M. (2005) · Mobile Networks and Applications · doi:10.1007/s11036-005-4454-4 · Cited by 80
A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
Tzeng, W.-G., & Tzeng, Z.-J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_16 · Cited by 80
Admission control in peer groups
Kim, Y., Mazzocchi, D., & Tsudik, G. (2003) · IEEE International Symposium on Network Computing and Applications (NCA) · doi:10.1109/nca.2003.1201147 · Cited by 80
Access control and signatures via quorum secret sharing
Naor, M., & Wool, A. (1998) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.722223 · Cited by 80
Enhancement of a Lightweight Attribute-Based Encryption Scheme for the Internet of Things
Tan, S., Yeow, K.-W., & Hwang, S. O. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2900631 · Cited by 79
An Efficient and Robust Data Aggregation Scheme Without a Trusted Authority for Smart Grid
Xue, K., Zhu, B., Yang, Q., Wei, D. S. L., & Guizani, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2961966 · Cited by 79
Practical Privacy Preserving POI Recommendation
Chen, C., Zhou, J., Wu, B., Fang, W., Wang, L., Qi, Y., & Zheng, X. (2020) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3394138 · Cited by 82
Using Secure Multi-Party Computation to Protect Privacy on a Permissioned Blockchain
Zhou, J., Feng, Y., Wang, Z., & Guo, D. (2021) · Sensors · doi:10.3390/s21041540 · Cited by 79
Optimum Secret Sharing Scheme Secure against Cheating
Ogata, W., Kurosawa, K., & Stinson, D. R. (2006) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480100378689 · Cited by 79
A new efficient (t,n) verifiable multi-secret sharing (VMSS) based on YCH scheme
Shao, J., & Cao, Z. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2004.08.023 · Cited by 79
Exploring Energy Efficiency of Lightweight Block Ciphers
Banik, S., Bogdanov, A., & Regazzoni, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31301-6_10 · Cited by 79
Scalable Privacy-Preserving Distributed Learning
Froelicher, D., Troncoso-Pastoriza, J. R., Pyrgelis, A., Sav, S., Sousa, J. S., Bossuat, J.-P., & Hubaux, J. (2021) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2021-0030 · Cited by 82
Chen, C., Zhou, J., Wang, L., Wu, X., Fang, W., Tan, J., Wang, L., Liu, A. X., Wang, H., & Hong, C. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467210 · Cited by 81
Reversible Data Hiding in Encrypted Images Using Cipher-Feedback Secret Sharing
Hua, Z., Wang, Y., Yi, S., Zhou, Y., & Jia, X. (2022) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2022.3140974 · Cited by 78
POTSHARDS—a secure, recoverable, long-term archival storage system
Storer, M. W., Greenan, K. M., Miller, E. L., & Voruganti, K. (2009) · ACM Transactions on Storage · doi:10.1145/1534912.1534914 · Cited by 78
Characterizing Ideal Weighted Threshold Secret Sharing
Beimel, A., Tassa, T., & Weinreb, E. (2008) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480104445654 · Cited by 78
Goldreich, O., Micali, S. M., & Wigderson, A. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_11 · Cited by 78
Performance Optimization Using Multipath Routing in Mobile Ad Hoc and Wireless Sensor Networks
Lou, W., Liu, W., & Zhang, Y. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-29026-5_5 · Cited by 78
Cachin, C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60693-9_22 · Cited by 78
Verifiable secret redistribution for archive systems
Wong, T. M., Wang, C., & Wing, J. M. (2003) · International IEEE Security in Storage Workshop (SISW) · doi:10.1109/sisw.2002.1183515 · Cited by 78
Zhou, J., & Gollmann, D. (1997) · Journal of Network and Computer Applications · doi:10.1006/jnca.1997.0056 · Cited by 78
Cryptographic support for fault-tolerant distributed computing
Minsky, Y. M., van Renesse, R., Schneider, F. B., & Stoller, S. D. (1996) · ACM SIGOPS European Workshop · doi:10.1145/504450.504472 · Cited by 78
A trust based approach for protecting user data in social networks
Ali, B. A., Villegas, W., & Maheswaran, M. (2007) · IEEE International Conference on Collaborative Advances in Software and Computing (CASCON) · doi:10.1145/1321211.1321251 · Cited by 78
Image Based Steganography to Facilitate Improving Counting-Based Secret Sharing
Gutub, A. A. A., & Al-Ghamdi, M. (2019) · 3D Research · doi:10.1007/s13319-019-0216-0 · Cited by 77
Xiong, J., Bi, R., Tian, Y., Liu, X., & Wu, D. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3093573 · Cited by 80
A blockchain-based secure data-sharing framework for Software Defined Wireless Body Area Networks
Hasan, K., Chowdhury, M. J. M., Biswas, K., Ahmed, K. E. U., Islam, M. S., & Usman, M. (2022) · Computer Networks · doi:10.1016/j.comnet.2022.109004 · Cited by 78
Constant-Round MPC with Fairness and Guarantee of Output Delivery
Gordon, S., Liu, F.-H., & Shi, E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48000-7_4 · Cited by 77
Privacy Preserving Data Sharing With Anonymous ID Assignment
Dunning, L. A., & Kresman, R. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2235831 · Cited by 77
Private, Yet Practical, Multiparty Deep Learning
Zhang, X., Ji, S., Wang, H., & Wang, T. (2017) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2017.215 · Cited by 79
Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing
Bao, L., Yi, S., & Zhou, Y. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2738561 · Cited by 77
Universal Service-Providers for Private Information Retrieval
Crescenzo, G. D., Ishai, Y., & Ostrovsky, R. (2001) · Journal of Cryptology · doi:10.1007/s001450010008 · Cited by 77
Visual cryptography for print and scan applications
Yan, W., Jin, D., & Kankanhalli, M. (2004) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2004.1329727 · Cited by 76
Hierarchical and Shared Access Control
Castiglione, A., Santis, A. D., Masucci, B., Palmieri, F., Castiglione, A., Li, J., & Huang, X. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2512533 · Cited by 76
Designing cloud-based electronic health record system with attribute-based encryption
Xhafa, F., Li, J., Zhao, G., Li, J., Chen, X., & Wong, D. S. (2015) · Multimedia Tools and Applications · doi:10.1007/s11042-013-1829-6 · Cited by 76
Ideal Multipartite Secret Sharing Schemes
Farràs, O., Martí-Farré, J., & Padró, C. (2011) · Journal of Cryptology · doi:10.1007/s00145-011-9101-6 · Cited by 76
Programmable Order-Preserving Secure Index for Encrypted Database Query
Liu, D., & Wang, S. (2012) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud.2012.65 · Cited by 76
Secure Logging as a Service—Delegating Log Management to the Cloud
Ray, I., Belyaev, K., Strizhov, M., Mulamba, D., & Rajaram, M. (2013) · IEEE Systems Journal · doi:10.1109/jsyst.2012.2221958 · Cited by 76
Nonperfect Secret Sharing Schemes and Matroids
Kurosawa, K., Okada, K., Sakano, K., Ogata, W., & Tsujii, S. (2007) · Springer eBooks · doi:10.1007/3-540-48285-7_11 · Cited by 76
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains
Yu, M., Sahraei, S., Li, S., Avestimehr, S., Kannan, S., & Viswanath, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51280-4_8 · Cited by 75
A Privacy-Preserving Federated Learning System for Android Malware Detection Based on Edge Computing
Hsu, R., Wang, Y., Fan, C., Sun, B., Ban, T., Takahashi, T., Wu, T.-W., & Kao, S.-W. (2020) · Asia Joint Conference on Information Security (AsiaJCIS) · doi:10.1109/asiajcis50894.2020.00031 · Cited by 77
Reversible Data Hiding in Encrypted Image via Secret Sharing Based on GF ( p ) and GF (2⁸)
Qin, C., Jiang, C., Mo, Q., Yao, H., & Chang, C. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2021.3091319 · Cited by 75
Secret sharing with multi-cover adaptive steganography
Yuan, H. (2013) · Information Sciences · doi:10.1016/j.ins.2013.08.012 · Cited by 75
Azar, Y., Kamara, S., Menache, I., Raykova, M., & Shepard, B. (2014) · doi:10.1145/2664168.2664179 · Cited by 75
Threshold cryptography based on Asmuth–Bloom secret sharing
Kaya, K., & Selçuk, A. A. (2007) · Information Sciences · doi:10.1016/j.ins.2007.04.008 · Cited by 75
Protecting AES with Shamir’s Secret Sharing Scheme
Goubin, L., & Martinelli, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_6 · Cited by 75
Threshold Schemes with Disenrollment
Blakley, B., Blakley, G. R., Chan, A. H., & Massey, J. L. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_38 · Cited by 75
Time-Controllable Keyword Search Scheme With Efficient Revocation in Mobile E-Health Cloud
Miao, Y., Li, F., Li, X., Liu, Z., Ning, J., Li, H., Choo, K. R., & Deng, R. H. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3277702 · Cited by 74
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
Lysyanskaya, A., & Peikert, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_20 · Cited by 74
Thwarting Higher-Order Side Channel Analysis with Additive and Multiplicative Maskings
Genelle, L., Prouff, E., & Quisquater, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_16 · Cited by 74
A general (k, n) scalable secret image sharing scheme with the smooth scalability
Yang, C., & Chu, Y.-Y. (2011) · Journal of Systems and Software · doi:10.1016/j.jss.2011.05.008 · Cited by 74
Fault-tolerant and progressive transmission of images
Chen, S.-K., & Lin, J. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.04.002 · Cited by 74
An anonymous and failure resilient fair-exchange e-commerce protocol
Ray, I., Ray, I., & Narasimhamurthi, N. (2003) · Decision Support Systems · doi:10.1016/j.dss.2003.10.011 · Cited by 74
Diversity against accidental and deliberate faults
Deswarte, Y., Kanoun, K., & Laprie, J.-C. (2002) · doi:10.1109/csda.1998.798364 · Cited by 74
Fully Distributed Threshold RSA under Standard Assumptions
Fouque, P.-A., & Stern, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_19 · Cited by 74
Fuzzy Identity Based Signature.Preprint
Yang, P., Cao, Z., & Dong, X. (2008) · IACR Cryptology ePrint Archive · Cited by 74
A localized certificate revocation scheme for mobile ad hoc networks
Arboit, G., Crépeau, C., Davis, C. R., & Maheswaran, M. (2006) · Ad Hoc Networks · doi:10.1016/j.adhoc.2006.07.003 · Cited by 73
Differential privacy: its technological prescriptive using big data
Jain, P., Gyanchandani, M., & Khare, N. (2018) · Journal Of Big Data · doi:10.1186/s40537-018-0124-9 · Cited by 73
Multistage secret sharing based on one-wayfunction
Harn, L. (1995) · Electronics Letters · doi:10.1049/el:19950201 · Cited by 73
On achieving the "best of both worlds" in secure multiparty computation
Katz, J. I. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250793 · Cited by 73
Proxy-Free Privacy-Preserving Task Matching with Efficient Revocation in Crowdsourcing
Shu, J., Yang, K., Jia, X., Liu, X., Wang, C., & Deng, R. H. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2018.2875682 · Cited by 73
Threshold DSS Signatures without a Trusted Party
Langford, S. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_32 · Cited by 73
Simple constant-time consensus protocols in realistic failure models
Chor, B., Merritt, M., & Shmoys, D. B. (1989) · Journal of the ACM · doi:10.1145/65950.65956 · Cited by 73
Geometric secret sharing schemes and their duals
Jackson, W., & Martin, K. M. (1994) · Designs Codes and Cryptography · doi:10.1007/bf01388562 · Cited by 73
A certificate revocation scheme for wireless ad hoc networks
Crépeau, C., & Davis, C. R. (2003) · Security of ad hoc and Sensor Networks · doi:10.1145/986858.986866 · Cited by 73
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
Ishai, Y., & Eyal Kushilevitz, Z. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301275 · Cited by 73
On the Information Rate of Secret Sharing Schemes
Blundo, C., Santis, A. D., Gargano, L., & Vaccaro, U. (1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4_11 · Cited by 73
Privacy and Data Protection by Design - from policy to engineering
Danezis, G., Domingo-Ferrer, J., Hansen, M., Hoepman, J.-H., Metayer, D., Tirtea, R., & Schiffner, S. (2014) · UCL Discovery (University College London) · doi:10.2824/38623 · Cited by 89
Minimizing latency for secure distributed computing
Bitar, R., Parag, P., & Rouayheb, S. E. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007060 · Cited by 72
Iqbal, H., & Krawec, W. O. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2595-9 · Cited by 72
A Robust and Lightweight Privacy-Preserving Data Aggregation Scheme for Smart Grid
Wu, L., Fu, S., Luo, Y., Yan, H., Shi, H., & Xu, M. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3252593 · Cited by 72
A Data Sharing Scheme Based on Federated Learning in IoV
Hu, X., Li, R., Wang, L., Ning, Y., & Ota, K. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3266100 · Cited by 72
A Survey on Cyber-Resilience Approaches for Cyber-Physical Systems
Segovia, M., Hernan, J. M. R., Cavalli, A. R., & García-Alfaro, J. (2024) · ACM Computing Surveys · doi:10.1145/3652953 · Cited by 72
On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
Quisquater, M., Bart Preneel, A., & Vandewalle, J. P. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45664-3_14 · Cited by 72
Cryptography in radio frequency identification and fair exchange protocols
Avoine, G. (2005) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-3407 · Cited by 72
How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
Bendlin, R., Krehbiel, S., & Peikert, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38980-1_14 · Cited by 72
Storing Secrets on Continually Leaky Devices
Dodis, Y., Lewko, A. B., Waters, B. R., & Wichs, D. (2011) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.35 · Cited by 72
Adaptive and Secure Load-Balancing Routing Protocol for Service-Oriented Wireless Sensor Networks
Li, S., Zhao, S., Wang, X., Zhang, K., & Li, L. (2013) · IEEE Systems Journal · doi:10.1109/jsyst.2013.2260626 · Cited by 72
Roeder, T., & Schneider, F. B. (2010) · ACM Transactions on Computer Systems · doi:10.1145/1813654.1813655 · Cited by 72
Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin
Goldfeder, S., Bonneau, J., Gennaro, R., & Narayanan, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_18 · Cited by 72
Zichichi, M., Ferretti, S., & D’Angelo, G. (2020) · IEEE Access · doi:10.1109/access.2020.2998012 · Cited by 72
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
Cabello, S., Padró, C., & Sáez, G. (2002) · Designs Codes and Cryptography · doi:10.1023/a:1013856431727 · Cited by 72
Neto, A. L. M., Souza, A., Cunha, Í. F. S., Nogueira, M., Nunes, I. O., Cotta, L., Gentille, N., Loureiro, A. A. F., Aranha, D. F., Patil, H. K., et al. (2016) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/2994551.2994555 · Cited by 71
E-voting scheme using secret sharing and K-anonymity
Liu, Y., & Zhao, Q. (2018) · World Wide Web · doi:10.1007/s11280-018-0575-0 · Cited by 71
Zhou, T., Li, X., & Zhao, H. (2019) · Journal of Medical Systems · doi:10.1007/s10916-019-1430-2 · Cited by 71
Guaranteed Output Delivery Comes Free in Honest Majority MPC
Goyal, V., Song, Y., & Zhu, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_22 · Cited by 71
Jia, Z., & Jafar, S. A. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3013152 · Cited by 71
Secure Coded Multi-Party Computation for Massive Matrix Operations
Nodehi, H. A., & Maddah-Ali, M. A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3050853 · Cited by 71
CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learning
Schlegel, R., Kumar, S., Rosnes, E., & Amat, A. G. I. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3244243 · Cited by 75
Jahani-Nezhad, T., Maddah-Ali, M. A., Li, S., & Caire, G. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242702 · Cited by 79
Geo-fencing: Confining Wi-Fi Coverage to Physical Boundaries
Sheth, A. N., Seshan, S., & Wetherall, D. J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01516-8_19 · Cited by 71
Secure dynamic fragment and replica allocation in large-scale distributed file systems
Mei, A., Mancini, L. V., & Jajodia, S. (2003) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2003.1233711 · Cited by 71
Privacy-preserving nearest neighbor methods: comparing signals without revealing them
Rane, S. D., & Boufounos, P. T. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2230221 · Cited by 71
Bartolucci, S., Bernat, P., & Joseph, D. (2018) · IEEE/ACM International Workshop on Emerging Trends in Software Engineering for Blockchain (WETSEB) · doi:10.1145/3194113.3194118 · Cited by 74
Goyal, V., & Kumar, A. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188872 · Cited by 71
TIDS: threshold and identity-based security scheme for wireless ad hoc networks
Deng, H., & Agrawal, D. P. (2004) · Ad Hoc Networks · doi:10.1016/j.adhoc.2004.03.005 · Cited by 71
A Geometric Approach to Information-Theoretic Private Information Retrieval
Woodruff, D., & Yekhanin, S. (2005) · 20th Annual IEEE Conference on Computational Complexity (CCC'05) · doi:10.1109/ccc.2005.2 · Cited by 69
Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
Martínez-Peñas, U., & Kschischang, F. R. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2912165 · Cited by 70
ZombieLoad: Cross-Privilege-Boundary Data Sampling
Schwarz, M., Lipp, M., Moghimi, D., Bulck, J. V., Stecklina, J., Prescher, T., & Gruss, D. (2019) · Lirias · doi:10.48550/arxiv.1905.05726 · Cited by 81
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
