{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:05:02Z","timestamp":1787504702192,"version":"build-2736575974"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["WA 3907\/7-1"],"award-info":[{"award-number":["WA 3907\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BI 2492\/1-1"],"award-info":[{"award-number":["BI 2492\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tifs.2024.3394256","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T13:34:25Z","timestamp":1714138465000},"page":"5136-5150","source":"Crossref","is-referenced-by-count":5,"title":["Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4421-1024","authenticated-orcid":false,"given":"Rawad","family":"Bitar","sequence":"first","affiliation":[{"name":"School of Computation, Information and Technology, Institute of Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-4074","authenticated-orcid":false,"given":"Maximilian","family":"Egger","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology, Institute of Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-1947","authenticated-orcid":false,"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology, Institute of Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5341-9954","authenticated-orcid":false,"given":"Marvin","family":"Xhemrishi","sequence":"additional","affiliation":[{"name":"School of Computation, Information and Technology, Institute of Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834805"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965887"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206979"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511805318"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.5937\/tokosig2202120p"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref7","volume-title":"Linear\n                        Regression Analysis","volume":"329","author":"Seber","year":"2012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018628609742"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3524298"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3105365"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS49558.2021.9562193"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103822"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143199"},{"key":"ref20","article-title":"Rate-efficiency and straggler-robustness through\n                        partition in distributed two-sided secure matrix\n                    computation","author":"Kakar","year":"2018","journal-title":"arXiv:1810.13006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref22","article-title":"Lagrange coded computing: Optimal design for\n                        resiliency, security and privacy","author":"Yu","year":"2018","journal-title":"arXiv:1806.00939"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2925723"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965828"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-020-01887-y"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142295"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142355"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142358"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1049\/ipr2.12155"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-015-1571-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"ref34","first-page":"5152","article-title":"Coded sparse matrix\n                    multiplication","volume-title":"Proc. Int. Conf. Mach.\n                        Learn.","author":"Wang"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518059"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3186908"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206445"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965842"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919966"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206726"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/047174882x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref50","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed\n                        learning","volume-title":"Proc. 34th Int. Conf. Mach.\n                        Learn.","author":"Tandon"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref52","first-page":"1","article-title":"Polynomial codes: An optimal design for\n                        high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Yu"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/itw54588.2022.9965839"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1035044"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/10319981\/10508978.pdf?arnumber=10508978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T13:22:58Z","timestamp":1715347378000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10508978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3394256","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}