{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:22:31Z","timestamp":1783635751658,"version":"3.55.0"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62361010"],"award-info":[{"award-number":["62361010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004001","name":"Guizhou Provincial Science and Technology Department","doi-asserted-by":"publisher","award":["QianKeHe JiChu-ZK[2022]YiBan331"],"award-info":[{"award-number":["QianKeHe JiChu-ZK[2022]YiBan331"]}],"id":[{"id":"10.13039\/501100004001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003458","name":"Guizhou Normal University","doi-asserted-by":"publisher","award":["Xiao2024064"],"award-info":[{"award-number":["Xiao2024064"]}],"id":[{"id":"10.13039\/501100003458","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018533","name":"Major Scientific and Technological Special Project of Guizhou Province","doi-asserted-by":"publisher","award":["[2024]014"],"award-info":[{"award-number":["[2024]014"]}],"id":[{"id":"10.13039\/501100018533","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.knosys.2026.116197","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:20:42Z","timestamp":1780676442000},"page":"116197","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Batched verifiable distributed secure matrix polynomial computation"],"prefix":"10.1016","volume":"348","author":[{"given":"Yi","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6590-5757","authenticated-orcid":false,"given":"Weijie","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minyao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116197_b1","first-page":"1223","article-title":"Large scale distributed deep networks","volume":"vol. 25","author":"Dean","year":"2012"},{"issue":"3","key":"10.1016\/j.knosys.2026.116197_b2","doi-asserted-by":"crossref","first-page":"1514","DOI":"10.1109\/TIT.2017.2736066","article-title":"Speeding up distributed machine learning using codes","volume":"64","author":"Lee","year":"2017","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b3","series-title":"International Workshop on Federated and Transfer Learning for Data Sparsity and Confidentiality (in Conjunction with IJCAI)","first-page":"45","article-title":"Decentralized federated graph neural networks","author":"Pei","year":"2021"},{"issue":"7","key":"10.1016\/j.knosys.2026.116197_b4","doi-asserted-by":"crossref","first-page":"4227","DOI":"10.1109\/TIT.2019.2904055","article-title":"Coded computation over heterogeneous clusters","volume":"65","author":"Reisizadeh","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b5","doi-asserted-by":"crossref","unstructured":"A. Lapets, F. Jansen, K.D. Albab, R. Issa, L. Qin, M. Varia, A. Bestavros, Accessible privacy-preserving web-based data analysis for assessing and addressing economic inequalities, in: Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, 2018, pp. 1\u20135.","DOI":"10.1145\/3209811.3212701"},{"issue":"1","key":"10.1016\/j.knosys.2026.116197_b6","first-page":"3692","article-title":"Multi-task learning for straggler avoiding predictive job scheduling","volume":"17","author":"Yadwadkar","year":"2016","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"10.1016\/j.knosys.2026.116197_b7","doi-asserted-by":"crossref","first-page":"2379","DOI":"10.1109\/TIT.2021.3050853","article-title":"Secure coded multi-party computation for massive matrix operations","volume":"67","author":"Akbari-Nodehi","year":"2021","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.future.2021.10.017","article-title":"Non-interactive verifiable privacy-preserving federated learning","volume":"128","author":"Xu","year":"2022","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.knosys.2026.116197_b9","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/j.ins.2017.11.063","article-title":"New publicly verifiable computation for batch matrix multiplication","volume":"479","author":"Zhang","year":"2019","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116197_b10","series-title":"Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali","first-page":"351","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"Ben-Or","year":"2019"},{"issue":"7","key":"10.1016\/j.knosys.2026.116197_b11","doi-asserted-by":"crossref","first-page":"4038","DOI":"10.1109\/TIT.2020.2975021","article-title":"Gasp codes for secure distributed matrix multiplication","volume":"66","author":"D\u2019Oliveira","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"10.1016\/j.knosys.2026.116197_b12","doi-asserted-by":"crossref","first-page":"7420","DOI":"10.1109\/TIT.2021.3112952","article-title":"On the capacity of secure distributed batch matrix multiplication","volume":"67","author":"Jia","year":"2021","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b13","series-title":"2020 IEEE Conference on Communications and Network Security","first-page":"1","article-title":"Notes on communication and computation in secure distributed matrix multiplication","author":"D\u2019Oliveira","year":"2020"},{"issue":"1","key":"10.1016\/j.knosys.2026.116197_b14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/TCOMM.2020.3032196","article-title":"Coded computing for resilient, secure, and privacy-preserving distributed matrix multiplication","volume":"69","author":"Yu","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.knosys.2026.116197_b15","series-title":"2020 Iran Workshop on Communication and Information Theory","first-page":"1","article-title":"Coded secure multi-party computation for massive matrices with adversarial nodes","author":"Najarkolaei","year":"2020"},{"key":"10.1016\/j.knosys.2026.116197_b16","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume":"vol. 30","author":"Yu","year":"2017"},{"issue":"1","key":"10.1016\/j.knosys.2026.116197_b17","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TIT.2019.2929328","article-title":"On the optimal recovery threshold of coded matrix multiplication","volume":"66","author":"Dutta","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/j.knosys.2026.116197_b18","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1109\/TIT.2019.2963864","article-title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding","volume":"66","author":"Yu","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b19","series-title":"2017 IEEE International Symposium on Information Theory","first-page":"2900","article-title":"Minimizing latency for secure distributed computing","author":"Bitar","year":"2017"},{"key":"10.1016\/j.knosys.2026.116197_b20","doi-asserted-by":"crossref","first-page":"2722","DOI":"10.1109\/TIFS.2020.2972166","article-title":"Private and secure distributed matrix multiplication with flexible communication load","volume":"15","author":"Aliasgari","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"7","key":"10.1016\/j.knosys.2026.116197_b21","doi-asserted-by":"crossref","first-page":"4666","DOI":"10.1109\/TIT.2022.3158868","article-title":"Secure distributed matrix computation with discrete fourier transform","volume":"68","author":"Mital","year":"2022","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/j.knosys.2026.116197_b22","doi-asserted-by":"crossref","first-page":"3864","DOI":"10.1109\/TIT.2024.3359355","article-title":"General framework for linear secure distributed matrix multiplication with byzantine servers","volume":"70","author":"Makkonen","year":"2024","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/j.knosys.2026.116197_b23","doi-asserted-by":"crossref","first-page":"4396","DOI":"10.1109\/TIT.2024.3380738","article-title":"Modular polynomial codes for secure and robust distributed matrix multiplication","volume":"70","author":"Karpuk","year":"2024","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b24","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2025.3535091","article-title":"Algebraic geometry codes for secure distributed matrix multiplication","author":"Makkonen","year":"2025","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b25","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TIFS.2024.3524160","article-title":"Privacy-preserving coded schemes for multi-server federated learning with straggling links","volume":"20","author":"Liang","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.knosys.2026.116197_b26","series-title":"Asymptotically optimal secure aggregation for wireless federated learning with multiple servers","author":"Huang","year":"2025"},{"key":"10.1016\/j.knosys.2026.116197_b27","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2025.3577019","article-title":"Byzsecagg: A byzantine-resistant secure aggregation scheme for federated learning based on coded computing and vector commitment","author":"Jahani-Nezhad","year":"2025","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b28","series-title":"22nd International Conference on Artificial Intelligence and Statistics","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"Yu","year":"2019"},{"key":"10.1016\/j.knosys.2026.116197_b29","series-title":"2022 IEEE International Symposium on Information Theory","first-page":"832","article-title":"Generalized lagrange coded computing: A flexible computation-communication tradeoff","author":"Zhu","year":"2022"},{"issue":"1","key":"10.1016\/j.knosys.2026.116197_b30","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/JSAIT.2021.3053220","article-title":"Codedprivateml: A fast and privacy-preserving framework for distributed machine learning","volume":"2","author":"So","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.knosys.2026.116197_b31","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TIFS.2023.3326970","article-title":"Efficient coded multi-party computation at edge networks","volume":"19","author":"Vedadi","year":"2023","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.knosys.2026.116197_b32","series-title":"2024 IEEE International Symposium on Information Theory","first-page":"2568","article-title":"Secure distributed matrix multiplication with precomputation","author":"Cartor","year":"2024"},{"key":"10.1016\/j.knosys.2026.116197_b33","series-title":"Annual International Cryptology Conference","first-page":"34","article-title":"Fast large-scale honest-majority mpc for malicious adversaries","author":"Chida","year":"2018"},{"key":"10.1016\/j.knosys.2026.116197_b34","series-title":"2022 IEEE International Parallel and Distributed Processing Symposium","first-page":"628","article-title":"Adaptive verifiable coded computing: Towards fast, secure and private distributed machine learning","author":"Tang","year":"2022"},{"key":"10.1016\/j.knosys.2026.116197_b35","doi-asserted-by":"crossref","first-page":"4344","DOI":"10.1109\/TIFS.2024.3377929","article-title":"Group-wise verifiable coded computing under byzantine attacks and stragglers","volume":"19","author":"Hong","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"10.1016\/j.knosys.2026.116197_b36","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/JSAC.2022.3142364","article-title":"Hierarchical group testing for byzantine attack identification in distributed matrix multiplication","volume":"40","author":"Hong","year":"2022","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3","key":"10.1016\/j.knosys.2026.116197_b37","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1109\/TCC.2022.3228243","article-title":"Decode-and-compare: An efficient verification scheme for coded distributed edge computing","volume":"11","author":"Wang","year":"2022","journal-title":"IEEE Trans. Cloud Comput."},{"key":"10.1016\/j.knosys.2026.116197_b38","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2025.3573708","article-title":"Probabilistic group testing for distributed matrix-vector products with attacked workers","author":"Jain","year":"2025","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/j.knosys.2026.116197_b39","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TCCN.2024.3391317","article-title":"Coded distributed computing for resilient, secure and private matrix-vector multiplication in edge-enabled metaverse","volume":"10","author":"Qiu","year":"2024","journal-title":"IEEE Trans. Cogn. Commun. Netw."},{"key":"10.1016\/j.knosys.2026.116197_b40","series-title":"2022 IEEE International Symposium on Information Theory","first-page":"820","article-title":"Identifying reliable machines for distributed matrix-vector multiplication","author":"Jain","year":"2022"},{"key":"10.1016\/j.knosys.2026.116197_b41","series-title":"Annual International Cryptology Conference","first-page":"572","article-title":"Scalable and unconditionally secure multiparty computation","author":"Damg\u00e5rd","year":"2007"},{"issue":"1","key":"10.1016\/j.knosys.2026.116197_b42","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/JSAIT.2021.3052934","article-title":"Gcsa codes with noise alignment for secure coded multi-party batch matrix multiplication","volume":"2","author":"Chen","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126009238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126009238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:06:26Z","timestamp":1783634786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126009238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":42,"alternative-id":["S0950705126009238"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116197","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Batched verifiable distributed secure matrix polynomial computation","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116197","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116197"}}