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 601–700 of 1,021
Deploying Secure Multi-Party Computation for Financial Data Analysis
Bogdanov, D., Talviste, R., & Willemson, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32946-3_5 · Cited by 116
A Practical Protocol for Large Group Oriented Networks
Frankel, Y. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_8 · Cited by 116
Incentive Compatible Moving Target Defense against VM-Colocation Attacks in Clouds
Zhang, Y., Li, M., Bai, K., Yu, M., & Zang, W. (2012) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-3-642-30436-1_32 · Cited by 115
A Secure Cloud Backup System with Assured Deletion and Version Control
Rahumed, A., Chen, H. C. H., Tang, Y. S., Lee, P. P. C., & Lui, J. C. S. (2011) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2011.17 · Cited by 115
How Close are We to Realizing a Pragmatic VANET Solution? A Meta-Survey
Saini, M. K., Alelaiwi, A. A., & Saddik, A. E. (2015) · ACM Computing Surveys · doi:10.1145/2817552 · Cited by 115
Secure Distributed Computing With Straggling Servers Using Polynomial Codes
Yang, H., & Lee, J. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2846601 · Cited by 115
On the Origins and Variations of Blockchain Technologies
Sherman, A. T., Javani, F., Zhang, H., & Golaszewski, E. (2019) · IEEE Security & Privacy · doi:10.1109/msec.2019.2893730 · Cited by 115
Efficient trace and revoke schemes
Naor, M., & Benny Pinkas, B. (2010) · International Journal of Information Security · doi:10.1007/s10207-010-0121-2 · Cited by 115
Secret sharing schemes with bipartite access structure
Sáez, G., & Padró, C. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.887867 · Cited by 115
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
Georgiou, K., Magen, A., Pitassi, T., & Tourlakis, I. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.35 · Cited by 115
Some New Results on Key Distribution Patterns and Broadcast Encryption
Stinson, D. R., & van Trung, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008209004667 · Cited by 115
Increasing availability and security of an authentication service
Gong, L. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223866 · Cited by 115
Advances in cryptographic voting systems
Rivest, R. L., & Adida, B. (2006) · Cited by 115
Efficient privacy preserving video surveillance
Upmanyu, M., Namboodiri, A., Srinathan, K., & Jawahar, C. V. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459370 · Cited by 114
An Attribute-Based Controlled Collaborative Access Control Scheme for Public Cloud Storage
Xue, Y., Xue, K., Gai, N., Hong, J., Wei, D. S. L., & Hong, P. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2911166 · Cited by 114
Dynamic key management in wireless sensor networks: A survey
He, X., Niedermeier, M., & de Meer, H. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.12.010 · Cited by 113
Higher-Order Masking Schemes for S-Boxes
Carlet, C., Goubin, L., Prouff, E., Quisquater, M., & Rivain, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_21 · Cited by 113
Linear codes from simplicial complexes
Chang, S., & Hyun, J. Y. (2017) · Designs Codes and Cryptography · doi:10.1007/s10623-017-0442-5 · Cited by 113
BPDIMS:A Blockchain-based Personal Data and Identity Management System
Faber, B., Michelet, G. C., Weidmann, N., Mukkamala, R. R., & Vatrapu, R. (2019) · Hawaii International Conference on System Sciences (HICSS) · doi:10.24251/hicss.2019.821 · Cited by 116
Metasurface-empowered optical cryptography
Yang, H., Ou, K., Wan, H., Hu, Y., Wei, Z., Jia, H., Cheng, X., Liu, N., & Duan, H. (2023) · Materials Today · doi:10.1016/j.mattod.2023.06.003 · Cited by 114
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
Amir, Y., Danilov, C. B., Dolev, D., Kirsch, J., Lane, J. W., Nita-Rotaru, C., Olsen, J. I., & Zage, D. (2008) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2008.53 · Cited by 113
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
Wang, Q., Ren, K., Lou, W., & Zhang, Y. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062006 · Cited by 113
Revisiting the Computational Practicality of Private Information Retrieval
Olumofin, F., & Goldberg, I. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27576-0_13 · Cited by 112
Adopting secret sharing for reversible data hiding in encrypted images
Wu, X., Weng, J., & Yan, W. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.09.017 · Cited by 112
Efficient Multi-party Computation with Dispute Control
Beerliová-Trubíniová, Z., & Hirt, M. (2006) · Lecture notes in computer science · doi:10.1007/11681878_16 · Cited by 112
Information-Theoretic Private Information Retrieval: A Unified Construction
Beimel, A., & Ishai, Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_74 · Cited by 112
Canetti, R., & Goldwasser, S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_7 · Cited by 112
Tight Bounds on the Information Rate of Secret Sharing Schemes
Blundo, C., Santis, A. D., Simone, R. D., & Vaccaro, U. (1997) · Designs Codes and Cryptography · doi:10.1023/a:1008216403325 · Cited by 112
Password-protected secret sharing
Bagherzandi, A., Jarecki, S., Saxena, N., & Lu, Y. (2011) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2046707.2046758 · Cited by 111
A Survey of Applications of Identity-Based Cryptography in Mobile Ad-Hoc Networks
Zhao, S., Aggarwal, A., Frost, R., & Bai, X. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.020211.00045 · Cited by 111
Online data storage using implicit security
Parakh, A., & Kak, S. C. (2009) · Information Sciences · doi:10.1016/j.ins.2009.05.013 · Cited by 111
Chen, Y., Hung, T.-H., Hsieh, S.-H., & Shiu, C.-W. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2914557 · Cited by 111
SiRnn: A Math Library for Secure RNN Inference
Rathee, D., Rathee, M., Goli, R. K. K., Gupta, D., Sharma, R., Chandran, N., & Rastogi, A. (2021) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp40001.2021.00086 · Cited by 117
A novel secure communication scheme in vehicular ad hoc networks
Wang, N.-W., Huang, Y., & Chen, W. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.12.003 · Cited by 111
Private simultaneous messages protocols with applications
Ishai, Y., & Eyal Kushilevitz, Z. (2002) · Israel Symposium on Theory and Computing Systems (ISTCS) · doi:10.1109/istcs.1997.595170 · Cited by 111
Universally ideal secret-sharing schemes
Beimel, A., & Chor, B. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335890 · Cited by 111
Tanenbaum, A. S. (1981) · ACM Computing Surveys · doi:10.1145/356859.356864 · Cited by 111
How to Build Robust Shared Control Systems
Anderson, R., Ding, C., Helleseth, T., & Kløve, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1026421315292 · Cited by 110
Quantum state sharing of an arbitrary multiqubit state using nonmaximally entangled GHZ states
Man, Z., Xia, Y., & An, N. B. (2007) · The European Physical Journal D · doi:10.1140/epjd/e2007-00024-x · Cited by 110
Practical Asynchronous Distributed Key Generation
Das, S., Yurek, T., Xiang, Z., Miller, A. K., Kokoris-Kogias, L., & Ren, L. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833584 · Cited by 110
Supporting Privacy in Decentralized Additive Reputation Systems
Pavlov, E., Rosenschein, J. S., & Topol, Z. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24747-0_9 · Cited by 110
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Yang, C., & Ciou, C.-B. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2010.04.003 · Cited by 109
An alignment-free fingerprint cryptosystem based on fuzzy vault scheme
Li, P., Yang, X., Cao, K., Tao, X., Wang, R., & Tian, J. (2009) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2009.12.003 · Cited by 109
Biometric hash: high-confidence face recognition
Ngo, D. C. L., Teoh, A. B. J., & Goh, A. (2006) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2006.873780 · Cited by 109
Barak, B., & Sahai, A. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.43 · Cited by 109
Secure and anonymous decentralized Bitcoin mixing
Ziegeldorf, J. H., Matzutt, R., Henze, M., Grossmann, F., & Wehrle, K. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.05.018 · Cited by 109
A Secure and Verifiable Access Control Scheme for Big Data Storage in Clouds
Hu, C., Li, W., Cheng, X., Yu, J., Wang, S., & Bie, R. (2017) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2621106 · Cited by 109
Privacy-Preserving and Traceable Federated Learning for data sharing in industrial IoT applications
Chen, J., Xue, J., Wang, Y., Huang, L., Baker, T., & Zhou, Z. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119036 · Cited by 109
Privacy and Fairness in Federated Learning: On the Perspective of Tradeoff
Chen, H., Zhu, T., Zhang, T., Zhou, W., & Yu, P. S. (2023) · ACM Computing Surveys · doi:10.1145/3606017 · Cited by 118
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Ben‐Sasson, E., Fehr, S., & Ostrovsky, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_39 · Cited by 109
Hwang, M., Lin, I., & Lu, E. J. (2000) · doi:10.3233/inf-2000-11203 · Cited by 109
Lei, X., Liao, X., Huang, T., & Heriniaina, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.05.014 · Cited by 108
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Iftene, S. (2007) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2007.01.065 · Cited by 108
A survey of RFID privacy approaches
Langheinrich, M. (2008) · Personal and Ubiquitous Computing · doi:10.1007/s00779-008-0213-4 · Cited by 108
Cloud-Based MPC with Encrypted Data
Alexandru, A. B., Morari, M., & Pappas, G. J. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619835 · Cited by 108
Privacy-Preserving Methods for Sharing Financial Risk Exposures
Abbe, E. A., Khandani, A. E., & Lo, A. W. (2012) · American Economic Review · doi:10.1257/aer.102.3.65 · Cited by 108
An Energy-Efficient and Secure Routing Protocol for Intrusion Avoidance in IoT-Based WSN
Haseeb, K., Almogren, A., Islam, N., Din, I. U., & Jan, Z. (2019) · Energies · doi:10.3390/en12214174 · Cited by 108
ASPE: attribute-based secure policy enforcement in vehicular ad hoc networks
Huang, D., & Verma, M. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.04.011 · Cited by 108
Lin, S.-J., & Lin, J. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.001 · Cited by 108
Symmetrical multilevel diversity coding
Roche, J. R., Yeung, R. W., & Hau, K. P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.568720 · Cited by 108
Boldyreva, A. (2002) · Cited by 108
Kamara, S., Mohassel, P., & Riva, B. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382280 · Cited by 107
Linear authentication codes: bounds and constructions
Wang, H., Xing, C., & Safavi–Naini, R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809567 · Cited by 107
Wang, J., Li, L., Peng, H., & Yang, Y. (2017) · Physical Review A · doi:10.1103/physreva.95.022320 · Cited by 107
Chervyakov, N. I., Babenko, M. G., Tchernykh, A. N., Kucherov, N. N., Miranda-López, V., & Cortés-Mendoza, J. M. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.09.061 · Cited by 108
A blockchain-based attribute-based signcryption scheme to secure data sharing in the cloud
Eltayieb, N., Elhabob, R., Hassan, A., & Li, F. (2019) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2019.101653 · Cited by 109
Boneh, D., & Lipton, R. J. (1996) · USENIX Security Symposium · Cited by 107
Flexible Access Control with Master Keys
Chick, G. C., & Tavares, S. E. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_29 · Cited by 107
General constructions for information-theoretic private information retrieval
Beimel, A., Ishai, Y., & Eyal Kushilevitz, Z. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.03.002 · Cited by 107
Doumen, J. M., Brinkman, R. L., & Jonker, W. (2004) · University of Twente Research Information · Cited by 107
Building intrusion tolerant applications
Malkin, M., Wu, T. D., & Boneh, D. (2002) · DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2000.824963 · Cited by 107
Stajano, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25867-1_6 · Cited by 106
Medical image security and EPR hiding using Shamir's secret sharing scheme
Ulutaş, M., Ulutaş, G., & Nabiyev, V. V. (2010) · Journal of Systems and Software · doi:10.1016/j.jss.2010.11.928 · Cited by 106
Balasubramanian, K., & Rajakani, M. (2017) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-5225-2915-6.ch013 · Cited by 106
PTAS: Privacy-preserving Thin-client Authentication Scheme in blockchain-based PKI
Jiang, W., Li, H., Xu, G., Wen, M., Dong, G., & Lin, X. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.01.026 · Cited by 106
Kher, V., & Kim, Y. (2005) · Workshop On Storage Security And Survivability · doi:10.1145/1103780.1103783 · Cited by 106
Trustworthy Privacy-Preserving Car-Generated Announcements in Vehicular Ad Hoc Networks
Daza, V., Domingo‐Ferrer, J., Sebé, F., & Viejo, A. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2008.2002581 · Cited by 106
On the (Im)possibility of Cryptography with Imperfect Randomness
Dodis, Y., Ong, S. J., Prabhakaran, M., & Sahai, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.44 · Cited by 106
Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme
Battistello, A., Coron, J.-S., Prouff, E., & Zeitoun, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53140-2_2 · Cited by 106
Protecting secret keys with personal entropy
Ellison, C. M., Hall, C., Milbert, R., & Schneier, B. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00055-2 · Cited by 106
Distributed Privacy-Preserving Aggregation of Metering Data in Smart Grids
Rottondi, C., Verticale, G., & Krauß, C. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130716 · Cited by 105
Security analysis of cryptographically controlled access to XML documents
Abadi, M., & Warinschi, B. (2005) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1065167.1065182 · Cited by 105
PriPAYD: Privacy-Friendly Pay-As-You-Drive Insurance
Troncoso, C., Danezis, G., Kosta, E., Balasch, J., & Bart Preneel, A. (2010) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2010.71 · Cited by 105
A practical verifiable multi-secret sharing scheme
Zhao, J., Zhang, J., & Zhao, R. (2006) · Computer Standards & Interfaces · doi:10.1016/j.csi.2006.02.004 · Cited by 105
Cryptographic defense against traffic analysis
Rackoff, C., & Simon, D. R. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167260 · Cited by 105
Multi-Agent Systems and Blockchain: Results from a Systematic Literature Review
Calvaresi, D., Dubovitskaya, A., Calbimonte, J.-P., Taveter, K., & Schumacher, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94580-4_9 · Cited by 110
Emotion recognition using secure edge and cloud computing
Hossain, M. S., & Muhammad, G. (2019) · Information Sciences · doi:10.1016/j.ins.2019.07.040 · Cited by 104
EaSTFLy: Efficient and secure ternary federated learning
Dong, Y., Chen, X., Shen, L., & Wang, D. (2020) · Computers & Security · doi:10.1016/j.cose.2020.101824 · Cited by 105
Some Applications of Coding Theory in Cryptography
Massey, J. L. (1999) · Cited by 104
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
Chow, S. S. M., Hui, L. C. K., Yiu, S., & Chow, K. P. (2005) · Lecture notes in computer science · doi:10.1007/11506157_27 · Cited by 104
Secure floating point arithmetic and private satellite collision analysis
Kamm, L., & Willemson, J. (2014) · International Journal of Information Security · doi:10.1007/s10207-014-0271-8 · Cited by 103
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs
Wolchoky, S., Hofmanny, O. S., Heninger, N., Felten, E. W., Halderman, J. A., Rossbach, C. J., Waters, B. R., & Witchel, E. (2010) · Network and Distributed System Security Symposium · Cited by 103
Nabil, M., Ismail, M., Mahmoud, M. M. E. A., Alasmary, W., & Serpedin, E. (2019) · IEEE Access · doi:10.1109/access.2019.2925322 · Cited by 103
Hiding shares by multimedia image steganography for optimized counting-based secret sharing
Gutub, A. A. A., & Al-Ghamdi, M. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-019-08427-x · Cited by 103
Generalized Linear Threshold Scheme
Kothari, S. C. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_19 · Cited by 103
Redundancy and Diversity in Security
Bev Littlewood, A., & Strigini, L. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30108-0_26 · Cited by 103
Fairness with an Honest Minority and a Rational Majority
Ong, S. J., Parkes, D. C., Rosen, A., & Vadhan, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_3 · Cited by 102
BPIIoT: A Light-Weighted Blockchain-Based Platform for Industrial IoT
Li, B., Hu, M., Liu, M., & Wang, J. (2019) · IEEE Access · doi:10.1109/access.2019.2914223 · Cited by 102
A survey on federated learning: a perspective from multi-party computation
Liu, F., Zheng, Z., Shi, Y., Tong, Y., & Zhang, Y. (2023) · Frontiers of Computer Science · doi:10.1007/s11704-023-3282-7 · Cited by 105
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
