{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:22:07Z","timestamp":1760145727843,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371101","2023KP01609","2022YFC3005072","YQ24207"],"award-info":[{"award-number":["62371101","2023KP01609","2022YFC3005072","YQ24207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Laboratory of Wireless Communications Foundation","award":["62371101","2023KP01609","2022YFC3005072","YQ24207"],"award-info":[{"award-number":["62371101","2023KP01609","2022YFC3005072","YQ24207"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"publisher","award":["62371101","2023KP01609","2022YFC3005072","YQ24207"],"award-info":[{"award-number":["62371101","2023KP01609","2022YFC3005072","YQ24207"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Automatic Detecting Technology and Instruments","award":["62371101","2023KP01609","2022YFC3005072","YQ24207"],"award-info":[{"award-number":["62371101","2023KP01609","2022YFC3005072","YQ24207"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Secure distributed matrix multiplication (SDMM) schemes are crucial for distributed learning algorithms where extensive data computation is distributed across multiple servers. Inspired by the application of repairing Reed\u2013Solomon (RS) codes in distributed storage and secret sharing, we propose SDMM schemes with reduced communication overhead through the use of trace polynomials. Specifically, these schemes are designed to address three critical concerns: (i) ensuring information-theoretic privacy against collusion among servers; (ii) providing security against Byzantine servers; and (iii) offering resiliency against stragglers to mitigate computing delays. To the best of our knowledge, security and resiliency are being considered for the first time within trace polynomial-based approaches. Furthermore, our schemes offer the advantage of reduced sub-packetization and a lower server-count requirement, which diminish the computational complexity and download cost for the user.<\/jats:p>","DOI":"10.3390\/e26090743","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T09:39:32Z","timestamp":1725010772000},"page":"743","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Communication-Efficient Distributed Matrix Multiplication Scheme with Privacy, Security, and Resiliency"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6640-7713","authenticated-orcid":false,"given":"Tao","family":"Wang","sequence":"first","affiliation":[{"name":"National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu 611731, China"}]},{"given":"Zhiping","family":"Shi","sequence":"additional","affiliation":[{"name":"National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu 611731, China"}]},{"given":"Juan","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Automation, Guilin University of Aerospace Technology, Guilin 541004, China"},{"name":"Guangxi Key Laboratory of Automatic Detecting Technology and Instruments, Guilin University of Electronic Technology, Guilin 541004, China"}]},{"given":"Sha","family":"Liu","sequence":"additional","affiliation":[{"name":"National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu 611731, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"key":"ref_1","unstructured":"Yu, Q., Maddah-Ali, M.A., and Avestimehr, A.S. (2017, January 4\u20139). Polynomial codes: An optimal design for high-dimensional coded matrix multiplication. Proceedings of the Advances in Neural Information Processing Systems (NIPS), Long Beach, CA, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chang, W., and Tandon, R. (2018, January 9\u201313). On the capacity of secure distributed matrix multiplication. Proceedings of the 2018 IEEE Global Communications Conference (GLOBELCOM), Dhabi, United Arab Emirates.","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref_3","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":"Rouayheb","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/JSAIT.2021.3102882","article-title":"Degree tables for secure distributed matrix multiplication","volume":"2","author":"Rouayheb","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"D\u2019Oliveira, R.G., Rouayheb, S.E., Heinlein, D., and Karpuk, D. (2020, January 28\u201330). Notes on communication and computation in secure distributed matrix multiplication. Proceedings of the 2020 IEEE Conference on Communications and Network Security (CNS), Avignon, France.","DOI":"10.1109\/CNS48642.2020.9162296"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TIFS.2018.2846601","article-title":"Secure distributed computing with straggling servers using polynomial codes","volume":"14","author":"Yang","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"45782","DOI":"10.1109\/ACCESS.2019.2908024","article-title":"On the capacity and straggler-roubustness of distributed matrix multiplication","volume":"7","author":"Kakar","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, H.H., Matthews, G.L., and Valvo, D. (2022, January 1\u20139). Secure MatDot codes: A secure, distributed matrix multiplication scheme. Proceedings of the 2022 IEEE Information Theory Workshop (ITW), Mumbai, India.","DOI":"10.1109\/ITW54588.2022.9965839"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"4666","DOI":"10.1109\/TIT.2022.3158868","article-title":"Secure distributed matrix computation with discrete fourier transform","volume":"86","author":"Mital","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Yu, Q., and Avestimehr, A.S. (2020, January 21\u201326). Entangled polynomial codes for secure, private, and batch distributed matrix multiplication: Breaking the \u201ccubic\u201d barrier. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref_11","unstructured":"Yu, Q., Li, S., Raviv, N., Kalan, S.M.M., Soltanolkotabi, M., and Avestimehr, S.A. (2019, January 16\u201318). Lagrange coded computing: Optimal design for resiliency, security, and privacy. Proceedings of the 22nd International Conference on Artificial Intelligence and Statiscs (AISTATS), Okinawa, Japan."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Byrne, E., Gnilke, O.W., and Kliewer, J. (2023). Straggler-and adversary-tolerant secure distributed matrix multiplication using polynomial codes. Entropy, 25.","DOI":"10.3390\/e25020266"},{"key":"ref_13","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. Inf. Theory"},{"key":"ref_14","first-page":"5684","article-title":"Repairing Reed\u2013Solomon codes","volume":"63","author":"Guruswami","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1109\/TIT.2018.2876542","article-title":"Repairing multiple failures for scalar mds codes","volume":"65","author":"Mardia","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Tamo, I., Ye, M., and Barg, A. (2017, January 15\u201317). Optimal repair of Reed\u2013Solomon codes: Achieving the cut-set bound. Proceedings of the 2017 IEEE 58th Annual Symposium on Foundations Computer Science (FOCS), Berkeley, CA, USA.","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Machado, R.A., D\u2019Oliveira, R.G., Rouayheb, S.E., and Heinlein, D. (2021, January 25\u201329). Field trace polynomial codes for secure distributed matrix multiplication. Proceedings of the 2021 XVII International Symposium Problems Redundancy in Information and Control Systems (RED), Moscow, Russia.","DOI":"10.1109\/REDUNDANCY52534.2021.9606447"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5552","DOI":"10.1109\/TIT.2024.3366817","article-title":"Explicit low-bandwidth evaluation schemes for weighted sums of Reed\u2013Solomon-coded symbols","volume":"70","author":"Kiah","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Lidl, R., and Niederreiter, H. (1997). Finite Filed, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511525926"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kruglik, S., Luo, G., Lim, W., Singhvi, S., Kiah, H.M., Ling, S., and Wang, H. (2023, January 25\u201332). Repair of Reed\u2013Solomon codes in the presence of erroneous nodes. Proceedings of the 2023 IEEE International Symposium on Information Theory (ISIT), Taipei, Taiwan.","DOI":"10.1109\/ISIT54713.2023.10206718"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/9\/743\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:45:50Z","timestamp":1760111150000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/9\/743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":20,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["e26090743"],"URL":"https:\/\/doi.org\/10.3390\/e26090743","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,8,30]]}}}