{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:15Z","timestamp":1773377535739,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1910309"],"award-info":[{"award-number":["1910309"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518207","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"78-83","source":"Crossref","is-referenced-by-count":1,"title":["Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers"],"prefix":"10.1109","author":[{"given":"Qifa","family":"Yan","sequence":"first","affiliation":[{"name":"University of Illinois Chicago,Chicago,IL,USA,60607"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Tuninetti","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago,Chicago,IL,USA,60607"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2937634"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977073"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174083"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref14","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref4","article-title":"On the optimal load-memory tradoeff of cache-aided scaler linear function retrieval","author":"wan","year":"0","journal-title":"ArXiv"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref6","article-title":"Fundamental limits of caching for demand privacy against colluding users","author":"yan","year":"0","journal-title":"ArXiv"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref7","article-title":"Key superposition simultaneously achieves security and privacy in cache-aided linear function retrieval","author":"yan","year":"0","journal-title":"ArXiv"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518207.pdf?arnumber=9518207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:18Z","timestamp":1773347658000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518207\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518207","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}