{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:04:14Z","timestamp":1725599054955},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"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,4,11]]},"DOI":"10.1109\/itw46852.2021.9457610","type":"proceedings-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T20:31:13Z","timestamp":1624393873000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval"],"prefix":"10.1109","author":[{"given":"Qifa","family":"Yan","sequence":"first","affiliation":[{"name":"University of Illinoise at Chicago,Chicago,IL,USA,60607"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Tuninetti","sequence":"additional","affiliation":[{"name":"University of Illinoise at Chicago,Chicago,IL,USA,60607"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Fundametnal limits of device-to-device private caching with trusted server","year":"0","author":"wan","key":"ref10"},{"article-title":"On the optimal load-memory tradoeff of cache-aided scaler linear function retrieval","year":"0","author":"wan","key":"ref11"},{"article-title":"Key superposition simultaneously achieves security and privacy in cache-aided linear function retrieval","year":"0","author":"yan","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2870566"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"article-title":"Demand private coded caching","year":"0","author":"kamath","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244946"},{"article-title":"Demand-private coded caching and the exact tradeoff for N = K =2","year":"0","author":"kamath","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NCC48643.2020.9055996"},{"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"},{"article-title":"Fundamental limits of caching for demand privacy against colluding users","year":"0","author":"yan","key":"ref9"}],"event":{"name":"2020 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,4,11]]},"location":"Riva del Garda, Italy","end":{"date-parts":[[2021,4,15]]}},"container-title":["2020 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9457568\/9457569\/09457610.pdf?arnumber=9457610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:13:43Z","timestamp":1659485623000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9457610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/itw46852.2021.9457610","relation":{},"subject":[],"published":{"date-parts":[[2021,4,11]]}}}