{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T07:40:18Z","timestamp":1735630818774,"version":"3.32.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"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":[[2024,11,24]]},"DOI":"10.1109\/itw61385.2024.10807027","type":"proceedings-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:18:57Z","timestamp":1735586337000},"page":"79-84","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Memory-Rate Tradeoff for Secure Multi-Access Coded Caching: The Case of Largest Access Number"],"prefix":"10.1109","author":[{"given":"Han","family":"Fang","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Southeast University,Nanjing,China,210096"}]},{"given":"Qinyi","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Southeast University,Nanjing,China,210096"}]},{"given":"Nan","family":"Liu","sequence":"additional","affiliation":[{"name":"Southeast University,National Mobile Communications Research Laboratory,Nanjing,China,210096"}]},{"given":"Wei","family":"Kang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Southeast University,Nanjing,China,210096"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2765503"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457641"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3116229"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3104035"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771891"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206602"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3256417"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2018.8724457"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161659"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2981454"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3332597"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611437"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834353"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517876"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206719"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611394"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3355234"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834536"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3193723"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611506"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834460"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965900"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3174890"},{"journal-title":"to be submitted","article-title":"Optimal memory-rate tradeoff for secure multi-access coded caching: the case of largest access number","author":"Fang","key":"ref31"},{"issue":"8","key":"ref32","doi-asserted-by":"crossref","DOI":"10.3390\/e20080603","article-title":"Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching","volume":"20","author":"Tian","year":"2018","journal-title":"Entropy"}],"event":{"name":"2024 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2024,11,24]]},"location":"Shenzhen, China","end":{"date-parts":[[2024,11,28]]}},"container-title":["2024 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10806859\/10806904\/10807027.pdf?arnumber=10807027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:44:54Z","timestamp":1735627494000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10807027\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,24]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/itw61385.2024.10807027","relation":{},"subject":[],"published":{"date-parts":[[2024,11,24]]}}}