{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:06Z","timestamp":1773377886097,"version":"3.50.1"},"reference-count":53,"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.9834439","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2391-2396","source":"Crossref","is-referenced-by-count":11,"title":["Private Read Update Write (PRUW) with Storage Constrained Databases"],"prefix":"10.1109","author":[{"given":"Sajani","family":"Vithana","sequence":"first","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742"}]},{"given":"Sennur","family":"Ulukus","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3085363"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2900313"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989262"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"372","DOI":"10.3390\/info10120372","article-title":"The capacity of private information retrieval from decentralized uncoded caching databases","volume":"10","author":"wei","year":"2019","journal-title":"Information"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2964762"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2789426"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3010988"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.icte.2022.02.008"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3372224.3419188"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref22","article-title":"cpSGD: Communication-efficient and differentially-private distributed SGD","author":"agarwal","year":"2018","journal-title":"NeurIPS"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP49062.2020.9231531"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013152"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3011053"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2833050"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437880"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3125006"},{"key":"ref12","article-title":"Federated learning for mobile keyboard prediction","author":"hard","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142358"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00065"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00029"},{"key":"ref16","article-title":"Inverting gradients–how easy is it to break privacy in federated learning?","author":"geiping","year":"0"},{"key":"ref17","article-title":"Differentially private federated learning: A client level perspective","author":"geyer","year":"2017","journal-title":"NeurIPS"},{"key":"ref18","article-title":"Differentially private federated learning: An information-theoretic perspective","author":"asoodeh","year":"2020","journal-title":"ICML-FL"},{"key":"ref19","article-title":"Learning differentially private recurrent language models","author":"mcmahan","year":"2018","journal-title":"ICLRE"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500855"},{"key":"ref3","article-title":"Secure federated submodel learning","author":"niu","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3165400"},{"key":"ref5","article-title":"Efficient private federated submodel learning","author":"vithana","year":"2022","journal-title":"IEEE ICC"},{"key":"ref8","article-title":"Communication efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"AISTATS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518142"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174126"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884891"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3054764"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3136583"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890285"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2828310"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2948845"}],"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\/09834439.pdf?arnumber=9834439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:27Z","timestamp":1773347727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834439\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834439","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}