{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:03:50Z","timestamp":1725599030749},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"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":[[2021,6]]},"DOI":"10.1109\/icc42927.2021.9500850","type":"proceedings-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T20:49:21Z","timestamp":1628282961000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Secure and Server-User Private Linear Function Retrieval in Multi-Server Multi-User Systems"],"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\/ALLERTON.2017.8262857"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977058"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"article-title":"On the fundamental liimits of cache-aided multi-user private information retrieval","year":"0","author":"zhang","key":"ref13"},{"article-title":"On the optimal load-memory tradoeff of cache-aided scaler linear function retrieval","year":"0","author":"wan","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"article-title":"Fundamental limits of caching for demand privacy against colluding users","year":"0","author":"yan","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2888494"},{"article-title":"Key superposition simultaneously achieves security and privacy in cache-aided linear function retrieval","year":"0","author":"yan","key":"ref7"},{"key":"ref2","first-page":"161","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"}],"event":{"name":"ICC 2021 - IEEE International Conference on Communications","start":{"date-parts":[[2021,6,14]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2021,6,23]]}},"container-title":["ICC 2021 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9500243\/9500244\/09500850.pdf?arnumber=9500850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:08:08Z","timestamp":1659485288000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9500850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icc42927.2021.9500850","relation":{},"subject":[],"published":{"date-parts":[[2021,6]]}}}