{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:11:13Z","timestamp":1772907073196,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61801176"],"award-info":[{"award-number":["61801176"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["318937"],"award-info":[{"award-number":["318937"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["336005"],"award-info":[{"award-number":["336005"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tifs.2022.3147638","type":"journal-article","created":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T22:33:20Z","timestamp":1643409200000},"page":"659-669","source":"Crossref","is-referenced-by-count":23,"title":["Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers"],"prefix":"10.1109","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7582-7630","authenticated-orcid":false,"given":"Jie","family":"Li","sequence":"first","affiliation":[]},{"given":"Camilla","family":"Hollanti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517825"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102882"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112952"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3044727"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107942"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871050"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2900313"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2937634"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2903206"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2954336"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977073"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013152"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980833"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120316"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.4086\/toc.gs.2013.005"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5592-3"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/9781108183192"},{"key":"ref41","article-title":"Fast feasible and unfeasible matrix multiplication","author":"Pan","year":"2018","journal-title":"arXiv:1804.04102"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03338-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"ref45","article-title":"A non-commutative algorithm for multiplying $5\\times5$\n matrices using 99 multiplications","author":"Sedoglavic","year":"2017","journal-title":"arXiv:1707.06860"},{"key":"ref46","article-title":"A non-commutative algorithm for multiplying ($7\\times7$\n) matrices using 250 multiplications","author":"Sedoglavic","year":"2017","journal-title":"arXiv:1712.07935"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9652463\/09696353.pdf?arnumber=9696353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:22:01Z","timestamp":1705533721000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9696353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/tifs.2022.3147638","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}