{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:46Z","timestamp":1773377986223,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834873","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1211-1216","source":"Crossref","is-referenced-by-count":6,"title":["Analog Secure Distributed Matrix Multiplication over Complex Numbers"],"prefix":"10.1109","author":[{"given":"Okko","family":"Makkonen","sequence":"first","affiliation":[{"name":"Aalto University,Department of Mathematics and Systems Analysis,Finland"}]},{"given":"Camilla","family":"Hollanti","sequence":"additional","affiliation":[{"name":"Aalto University,Department of Mathematics and Systems Analysis,Finland"}]}],"member":"263","reference":[{"key":"ref32","article-title":"Numerically stable coded matrix com-putations via circulant and rotation matrix embeddings","author":"ramamoorthy","year":"2019"},{"key":"ref31","first-page":"193","article-title":"How (un) stable are Vandermonde systems?","author":"gautschi","year":"1990","journal-title":"Asymptotic Computational Anal"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.243446"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref12","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref3","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102882"},{"key":"ref29","author":"cover","year":"1999","journal-title":"Elements of Information Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref7","first-page":"1","article-title":"Notes on communication and computation in secure distributed matrix multi-plication","author":"d\u2019oliveira","year":"2020","journal-title":"2020 IEEE Conference on Communications and Network Security (CNS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref9","article-title":"Secure distributed matrix computation with discrete Fourier transform","author":"mital","year":"2020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3044727"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3052934"},{"key":"ref26","article-title":"Privacy-preserving distributed learning in the analog domain","author":"soleymani","year":"2020"},{"key":"ref25","article-title":"Privacy in distributed computations based on real number secret sharing","author":"tjell","year":"2021"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834873.pdf?arnumber=9834873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:47Z","timestamp":1773347747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834873\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834873","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}