{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:14Z","timestamp":1773377834257,"version":"3.50.1"},"reference-count":34,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834802","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2034-2039","source":"Crossref","is-referenced-by-count":2,"title":["Computational Code-Based Privacy in Coded Federated Learning"],"prefix":"10.1109","author":[{"given":"Marvin","family":"Xhemrishi","sequence":"first","affiliation":[{"name":"Technical University of Munich,Institute of Communications Engineering,Munich,Germany"}]},{"given":"Alexandre","family":"Graell i Amat","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology,Gothenburg,Sweden"}]},{"given":"Eirik","family":"Rosnes","sequence":"additional","affiliation":[{"name":"Simula UiB,Bergen,Norway"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Institute of Communications Engineering,Munich,Germany"}]}],"member":"263","reference":[{"key":"ref33","first-page":"995","article-title":"Progressive edge-growth Tanner graphs","author":"hu","year":"2001","journal-title":"Proc IEEE Globe Telecommun Conf (GLOBECOM)"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","article-title":"Information-set decoding for linear codes over ${{\\mathbb{F}}_q}$","author":"peters","year":"2010","journal-title":"Proc Int Workshop Post-Quantum Cryptography (PQCrypto)"},{"key":"ref31","first-page":"275","article-title":"An observation on the security of McEliece’s public-key cryptosystem","author":"lee","year":"1988","journal-title":"Proc Workshop Theory Appl Cryptographic Techniques (EUROCRYPT)"},{"key":"ref30","first-page":"13","article-title":"A new identification scheme based on syndrome decoding","author":"stern","year":"1993","journal-title":"Proc 13th Annu Int Cryptology Conf (CRYPTO)"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","article-title":"Decoding one out of many","author":"sendrier","year":"2011","journal-title":"Proc Int Workshop Post-Quantum Cryptography (PQCrypto)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref11","article-title":"Coding for straggler mitigation in federated learning","author":"kumar","year":"2022","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"key":"ref12","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42?44","author":"mceliece","year":"1978","journal-title":"Deep Space Network Progress Report"},{"key":"ref13","first-page":"159","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"niederreiter","year":"1986","journal-title":"Prob Contr Inf Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849600"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2700102"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2911496"},{"key":"ref19","first-page":"338","article-title":"A new construction for constant weight codes","author":"etzion","year":"2014","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref28","first-page":"83","article-title":"Sparse solutions to nonnegative linear systems and applications","author":"bhaskara","year":"2015","journal-title":"Proc Int Conf Artificial Intell Stats (AISTATS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2248414"},{"key":"ref3","article-title":"Asynchronous federated optimization","author":"xie","year":"2019"},{"key":"ref6","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst (NIPS)"},{"key":"ref29","article-title":"A Coding-Theoretic Approach to Cryptanalysis","author":"meurer","year":"2013","journal-title":"Ph D Dissertation"},{"key":"ref5","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn (ICML)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103822"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref2","first-page":"14606","article-title":"Linear convergence in federated learning: Tackling client heterogeneity and sparse gradients","author":"mitra","year":"2021","journal-title":"Proc Neural Inf Process Syst (NeurIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Int Conf Artificial Intell Stats (AISTATS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"ref21","article-title":"Systems and processes for decoding chain reaction codes through inactivation","author":"shokrollahi","year":"2005","journal-title":"US patent 6 856 263"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.53757"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310479"}],"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\/09834802.pdf?arnumber=9834802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:18Z","timestamp":1773347718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834802","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}