{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:23Z","timestamp":1773376763003,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206764","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1729-1734","source":"Crossref","is-referenced-by-count":13,"title":["HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian Codes"],"prefix":"10.1109","author":[{"given":"Roberto A.","family":"Machado","sequence":"first","affiliation":[{"name":"Clemson University,School of Mathematical and Statistical Sciences,Clemson,SC,USA,29634"}]},{"given":"Gretchen L.","family":"Matthews","sequence":"additional","affiliation":[{"name":"Virginia Tech,Department of Mathematics,Blacksburg,VA,USA,24061"}]},{"given":"Welington","family":"Santos","sequence":"additional","affiliation":[{"name":"Virginia Tech,Department of Mathematics,Blacksburg,VA,USA,24061"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517739"},{"key":"ref35","year":"2021","journal-title":"SageMath the Sage Mathematics Software System (Version 7 4)"},{"key":"ref12","article-title":"Adaptive private distributed matrix multiplication","author":"bitar","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY52534.2021.9606447"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965839"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0578-y"},{"key":"ref30","article-title":"Concatenating extended css codes for communication efficient quantum secret sharing","author":"senthoor","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3158868"},{"key":"ref33","article-title":"Codes from norm-trace curves: local recovery and fractional decoding","author":"murphy","year":"2022","journal-title":"Ph D dissertation Virginia Tech"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965858"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2823326"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142355"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref26","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref20","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref22","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107942"},{"key":"ref8","article-title":"Uplink-downlink tradeoff in secure distributed matrix multiplication","volume":"abs 1910 13849","author":"kakar","year":"2019"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CNS48642.2020.9162296"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849446"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989092"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206764.pdf?arnumber=10206764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:11Z","timestamp":1773347291000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206764","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}