{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T13:38:57Z","timestamp":1775741937941,"version":"3.50.1"},"reference-count":91,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.comnet.2026.112212","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:50:13Z","timestamp":1773215413000},"page":"112212","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A systematic review of secure coded caching"],"prefix":"10.1016","volume":"281","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3215-187X","authenticated-orcid":false,"given":"S.-L.","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3515-8436","authenticated-orcid":false,"given":"M.B.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4010-773X","authenticated-orcid":false,"given":"E.A.","family":"Quaglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.comnet.2026.112212_bib0001","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Maddah-Ali","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10.1016\/j.comnet.2026.112212_bib0002","first-page":"5821","article-title":"On the placement delivery array design for centralized coded caching scheme","volume":"63","author":"Yan","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"10.1016\/j.comnet.2026.112212_bib0003","doi-asserted-by":"crossref","first-page":"6193","DOI":"10.1109\/TIT.2021.3095471","article-title":"Subexponential and linear subpacketization coded caching via projective geometry","volume":"67","author":"Chittoor","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.comnet.2026.112212_bib0004","doi-asserted-by":"crossref","first-page":"7121","DOI":"10.1109\/TIT.2021.3112492","article-title":"A framework of constructing placement delivery arrays for centralized coded caching","volume":"67","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.comnet.2026.112212_bib0005","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TNET.2014.2317316","article-title":"Decentralized coded caching attains order-optimal memory-rate tradeoff","volume":"23","author":"Maddah-Ali","year":"2015","journal-title":"IEEE\/ACM Trans. Network."},{"issue":"12","key":"10.1016\/j.comnet.2026.112212_bib0006","doi-asserted-by":"crossref","first-page":"7253","DOI":"10.1109\/TIT.2016.2614722","article-title":"Multi-server coded caching","volume":"62","author":"Shariatpanahi","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.comnet.2026.112212_bib0007","doi-asserted-by":"crossref","first-page":"3212","DOI":"10.1109\/TIT.2016.2557804","article-title":"Hierarchical coded caching","volume":"62","author":"Karamchandani","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0008","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/LCOMM.2016.2631552","article-title":"Online coded caching with random access","volume":"21","author":"Yan","year":"2017","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"10.1016\/j.comnet.2026.112212_bib0009","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/JSAC.2018.2844960","article-title":"Adding transmitters dramatically boosts coded-caching gains for finite file sizes","volume":"36","author":"Lampiris","year":"2018","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.comnet.2026.112212_bib0010","series-title":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","first-page":"2274","article-title":"Multi-access coded caching with coded placement","author":"Namboodiri","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0011","series-title":"2022 IEEE International Symposium on Information Theory (ISIT)","first-page":"1518","article-title":"Extended placement delivery arrays for multi-antenna coded caching scheme","author":"Namboodiri","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0012","series-title":"2023 IEEE Information Theory Workshop (ITW)","first-page":"131","article-title":"A shared cache coded caching scheme using designs and circuits of matrices","author":"Das","year":"2023"},{"key":"10.1016\/j.comnet.2026.112212_bib0013","series-title":"Massive internet outage hits websites including Amazon, gov.uk and Guardian","volume":"6","author":"Hern","year":"2021"},{"key":"10.1016\/j.comnet.2026.112212_bib0014","series-title":"ACM Asia Conference on Computer and Communications Security (ASIACCS)","article-title":"A practical privacy-preserving CDN with oblivious content access, in: 20th","author":"Vo","year":"2025"},{"issue":"2","key":"10.1016\/j.comnet.2026.112212_bib0015","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TIFS.2014.2375553","article-title":"Fundamental limits of caching with secure delivery","volume":"10","author":"Sengupta","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112212_bib0016","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.jnca.2015.06.011","article-title":"Survey on caching approaches in information centric networking","volume":"56","author":"Abdullahi","year":"2015","journal-title":"J. Network Comput. Appl."},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0017","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/COMST.2018.2820021","article-title":"A survey of caching techniques in cellular networks: research issues and challenges in content placement and delivery strategies","volume":"20","author":"Li","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0018","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1109\/COMST.2019.2908280","article-title":"On mobile edge caching","volume":"21","author":"Yao","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"4","key":"10.1016\/j.comnet.2026.112212_bib0019","doi-asserted-by":"crossref","first-page":"2166","DOI":"10.1109\/COMST.2021.3093492","article-title":"Content delivery network security: a survey","volume":"23","author":"Ghaznavi","year":"2021","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.comnet.2026.112212_bib0020","article-title":"A systematic survey on content caching in ICN and ICN-IoT: challenges, approaches and strategies","volume":"233","author":"Pruthvi","year":"2023","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112212_bib0021","doi-asserted-by":"crossref","first-page":"8817","DOI":"10.1007\/s10586-024-04459-7","article-title":"Content caching in mobile edge computing: a survey","volume":"27","author":"Khan","year":"2024","journal-title":"Cluster Comput"},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0022","doi-asserted-by":"crossref","first-page":"818","DOI":"10.26599\/TST.2023.9010051","article-title":"A survey of edge caching: key issues and challenges","volume":"29","author":"Li","year":"2024","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.comnet.2026.112212_bib0023","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.inffus.2022.08.029","article-title":"Information fusion on delivery: a survey on the roles of mobile edge caching systems","volume":"89","author":"Nguyen","year":"2023","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.comnet.2026.112212_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.sysarc.2024.103306","article-title":"A survey of edge caching security: framework, methods, and challenges","volume":"158","author":"Zhang","year":"2025","journal-title":"J. Syst. Archit."},{"issue":"5","key":"10.1016\/j.comnet.2026.112212_bib0025","doi-asserted-by":"crossref","DOI":"10.1145\/3706630","article-title":"A survey on privacy-preserving caching at network edge: classification, solutions, and challenges","volume":"57","author":"Zhang","year":"2025","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.comnet.2026.112212_bib0026","doi-asserted-by":"crossref","DOI":"10.1145\/3609504","article-title":"Service caching and computation reuse strategies at the edge: a survey","volume":"56","author":"Barrios","year":"2023","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0027","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1109\/COMST.2021.3091684","article-title":"A comprehensive survey on coded distributed computing: fundamentals, challenges, and networking applications","volume":"23","author":"Ng","year":"2021","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.comnet.2026.112212_bib0028","series-title":"2017 IEEE International Symposium on Information Theory (ISIT)","first-page":"1232","article-title":"On the optimality of separation between caching and delivery in general cache networks","author":"Naderializadeh","year":"2017"},{"key":"10.1016\/j.comnet.2026.112212_bib0029","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"425","article-title":"Fundamental limits of secretive coded caching","author":"Ravindrakumar","year":"2016"},{"issue":"6","key":"10.1016\/j.comnet.2026.112212_bib0030","doi-asserted-by":"crossref","first-page":"4106","DOI":"10.1109\/TIT.2022.3150336","article-title":"Fundamental limits of demand-private coded caching","volume":"68","author":"Gurjarpadhye","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.comnet.2026.112212_bib0031","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TNET.2015.2394482","article-title":"Online coded caching","volume":"24","author":"Pedarsani","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2026.112212_bib0032","series-title":"Technical Report","article-title":"Informed-source coding-on-demand (ISCOD) over broadcast channels","author":"Birk","year":"1998"},{"key":"10.1016\/j.comnet.2026.112212_bib0033","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"2113","article-title":"Multi-antenna coded caching","author":"Shariatpanahi","year":"2017"},{"key":"10.1016\/j.comnet.2026.112212_bib0034","series-title":"50th Asilomar Conference on Signals, Systems and Computers","first-page":"1414","article-title":"Fundamental limits of secure device-to-device coded caching","author":"Zewail","year":"2016"},{"key":"10.1016\/j.comnet.2026.112212_bib0035","series-title":"2022 IEEE International Symposium on Information Theory (ISIT)","first-page":"1390","article-title":"Multiaccess coded caching with private demands","author":"Wan","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0036","series-title":"2022 IEEE Information Theory Workshop (ITW)","first-page":"678","article-title":"Shared cache coded caching schemes with known user-to-cache association profile using placement delivery arrays","author":"Peter","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0037","series-title":"Codes and cryptography","author":"Welsh","year":"1988"},{"issue":"9","key":"10.1016\/j.comnet.2026.112212_bib0038","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1109\/LCOMM.2022.3184765","article-title":"Coded caching with file and demand privacy","volume":"26","author":"Qi","year":"2022","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0039","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TIFS.2017.2765503","article-title":"Private coded caching","volume":"13","author":"Ravindrakumar","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112212_bib0040","series-title":"2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","first-page":"373","article-title":"Secretive coded caching from PDAs","author":"Meel","year":"2021"},{"issue":"9","key":"10.1016\/j.comnet.2026.112212_bib0041","doi-asserted-by":"crossref","first-page":"2849","DOI":"10.1109\/LCOMM.2021.3094405","article-title":"Secretive coded caching with shared caches","volume":"25","author":"Meel","year":"2021","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.comnet.2026.112212_bib0042","series-title":"2022 IEEE International Symposium on Information Theory (ISIT)","first-page":"1402","article-title":"A secretive coded caching for shared cache systems using placement delivery arrays","author":"Peter","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0043","series-title":"IEEE Information Theory Workshop","first-page":"66","article-title":"An improved secretive coded caching scheme exploiting common demands","author":"Suthan","year":"2017"},{"issue":"1","key":"10.1016\/j.comnet.2026.112212_bib0044","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TIT.2020.3036313","article-title":"On coded caching with private demands","volume":"67","author":"Wan","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0045","series-title":"Demand private coded caching","author":"Kamath","year":"2019"},{"key":"10.1016\/j.comnet.2026.112212_bib0046","series-title":"2020 National Conference on Communications (NCC)","first-page":"1","article-title":"Demand-private coded caching and the exact trade-off for n=k=2","author":"Kamath","year":"2020"},{"key":"10.1016\/j.comnet.2026.112212_bib0047","series-title":"2020 IEEE Information Theory Workshop (ITW)","first-page":"1","article-title":"Improved memory-rate trade-off for caching with demand privacy","author":"Gurjarpadhye","year":"2021"},{"key":"10.1016\/j.comnet.2026.112212_bib0048","series-title":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","first-page":"2280","article-title":"Multi-access coded caching with demand privacy","author":"Namboodiri","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0049","series-title":"Subpacketization in coded caching with demand privacy, in: 2020 National Conference on Communications (NCC)","author":"Aravind","year":"2020"},{"key":"10.1016\/j.comnet.2026.112212_bib0050","series-title":"On secure coded caching via combinatorial method","author":"Cheng","year":"2020"},{"key":"10.1016\/j.comnet.2026.112212_bib0051","series-title":"2022 IEEE International Symposium on Information Theory (ISIT)","first-page":"1396","article-title":"Coded caching with private demands and caches","author":"Gholami","year":"2022"},{"key":"10.1016\/j.comnet.2026.112212_bib0052","series-title":"2021 Computing, Communications and IoT Applications (ComComAp), 2021","first-page":"329","article-title":"Secure coded caching with colluding users","author":"Ma","year":"2021"},{"issue":"1","key":"10.1016\/j.comnet.2026.112212_bib0053","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/JSAIT.2021.3053372","article-title":"Fundamental limits of caching for demand privacy against colluding users","volume":"2","author":"Yan","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0054","series-title":"2021 IEEE International Symposium on Information Theory (ISIT)","first-page":"706","article-title":"Optimal demand private coded caching for users with small buffers","author":"Namboodiri","year":"2021"},{"issue":"9","key":"10.1016\/j.comnet.2026.112212_bib0055","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","article-title":"On sharing secrets and reed-solomon codes","volume":"24","author":"Mceliece","year":"1981","journal-title":"Commun. ACM"},{"key":"10.1016\/j.comnet.2026.112212_bib0056","series-title":"15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","first-page":"1","article-title":"A content-delivery protocol, exploiting the privacy benefits of coded caching","author":"Engelmann","year":"2017"},{"key":"10.1016\/j.comnet.2026.112212_bib0057","series-title":"IEEE International Conference on Communications (ICC)","first-page":"1","article-title":"CryptoCache: network caching with confidentiality","author":"Leguay","year":"2017"},{"issue":"4","key":"10.1016\/j.comnet.2026.112212_bib0058","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0059","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/JPROC.2010.2094592","article-title":"Theory of secure network coding","volume":"99","author":"Cai","year":"2011","journal-title":"Proc. IEEE"},{"issue":"6","key":"10.1016\/j.comnet.2026.112212_bib0060","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/CC.2015.7122470","article-title":"Low-complexity secure network coding against wiretapping using intra\/inter-generation coding","volume":"12","author":"Liu","year":"2015","journal-title":"China Commun."},{"key":"10.1016\/j.comnet.2026.112212_bib0061","series-title":"2019 34th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","first-page":"62","article-title":"A secure network coding system against wiretap attacks","author":"Wang","year":"2019"},{"key":"10.1016\/j.comnet.2026.112212_bib0062","series-title":"International Symposium on Information Theory","first-page":"143","article-title":"Byzantine modification detection in multicast networks using randomized network coding","author":"Ho","year":"2004"},{"key":"10.1016\/j.comnet.2026.112212_bib0063","series-title":"40th Annual Conference on Information Sciences and Systems","first-page":"857","article-title":"Signatures for network coding","author":"Charles","year":"2006"},{"key":"10.1016\/j.comnet.2026.112212_bib0064","series-title":"IEEE International Symposium on Information Theory","first-page":"556","article-title":"Signatures for content distribution with network coding","author":"Zhao","year":"2007"},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0065","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIT.2010.2103753","article-title":"Index coding with side information","volume":"57","author":"Bar-Yossef","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0066","series-title":"Index coding via linear programming","author":"Blasiak","year":"2010"},{"issue":"3","key":"10.1016\/j.comnet.2026.112212_bib0067","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/LCOMM.2015.2388477","article-title":"Index coding with coded side-information","volume":"19","author":"Lee","year":"2015","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"10.1016\/j.comnet.2026.112212_bib0068","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1109\/TIT.2015.2414926","article-title":"An equivalence between network coding and index coding","volume":"61","author":"Effros","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.comnet.2026.112212_bib0069","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/JSAIT.2021.3054847","article-title":"A code and rate equivalence between secure network and index coding","volume":"2","author":"Ong","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0070","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/TIT.2020.2967753","article-title":"An index coding approach to caching with uncoded cache placement","volume":"66","author":"Wan","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.comnet.2026.112212_bib0071","doi-asserted-by":"crossref","first-page":"3975","DOI":"10.1109\/TIT.2012.2188777","article-title":"On the security of index coding with side information","volume":"58","author":"Dau","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0072","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"596","article-title":"Private index coding","author":"Narayanan","year":"2018"},{"key":"10.1016\/j.comnet.2026.112212_bib0073","series-title":"2017 IEEE International Symposium on Information Theory (ISIT)","first-page":"2543","article-title":"Private broadcasting: an index coding approach","author":"Karmoose","year":"2017"},{"issue":"11","key":"10.1016\/j.comnet.2026.112212_bib0074","doi-asserted-by":"crossref","first-page":"7382","DOI":"10.1109\/TIT.2017.2743688","article-title":"Perfectly secure index coding","volume":"63","author":"Mojahedian","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0075","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"2834","article-title":"Secure index coding: existence and construction","author":"Ong","year":"2016"},{"key":"10.1016\/j.comnet.2026.112212_bib0076","series-title":"EUROCRYPT\u201999","first-page":"402","article-title":"Computationally private information retrieval with polylogarithmic communication","author":"Cachin","year":"1999"},{"key":"10.1016\/j.comnet.2026.112212_bib0077","series-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201997","first-page":"304","article-title":"Computationally private information retrieval (extended abstract","author":"Chor","year":"1997"},{"key":"10.1016\/j.comnet.2026.112212_bib0078","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"350","article-title":"Single-server single-message online private information retrieval with side information","author":"Kazemi","year":"2019"},{"key":"10.1016\/j.comnet.2026.112212_bib0079","series-title":"IEEE International Symposium on Information Theory (ISIT)","first-page":"1662","article-title":"Capacity of single-server single-message private information retrieval with private coded side information","author":"Heidarzadeh","year":"2019"},{"issue":"1","key":"10.1016\/j.comnet.2026.112212_bib0080","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TIT.2020.3029314","article-title":"The role of coded side information in single-server private information retrieval","volume":"67","author":"Heidarzadeh","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0081","series-title":"Proceedings 38th Annual Symposium on Foundations of Computer Science","first-page":"364","article-title":"Replication is not needed: single database, computationally-private information retrieval","author":"Kushilevitz","year":"1997"},{"key":"10.1016\/j.comnet.2026.112212_bib0082","series-title":"2020 IEEE International Symposium on Information Theory (ISIT)","first-page":"1083","article-title":"Single-server multi-message private information retrieval with side information: the general cases","author":"Li","year":"2020"},{"key":"10.1016\/j.comnet.2026.112212_bib0083","series-title":"IEEE Information Theory Workshop (ITW)","first-page":"1","article-title":"Private information delivery","author":"Sun","year":"2019"},{"key":"10.1016\/j.comnet.2026.112212_bib0084","series-title":"2017 55th Annual Allerton Conference on Communication, Control, and Computing","first-page":"1078","article-title":"The capacity of cache aided private information retrieval","author":"Tandon","year":"2017"},{"issue":"4","key":"10.1016\/j.comnet.2026.112212_bib0085","doi-asserted-by":"crossref","first-page":"2032","DOI":"10.1109\/TIT.2019.2948845","article-title":"Private information retrieval with side information","volume":"66","author":"Kadhe","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112212_bib0086","series-title":"2023 IEEE Information Theory Workshop (ITW)","first-page":"125","article-title":"Cache-aided multi-user private information retrieval using PDAs","author":"Vaidya","year":"2023"},{"key":"10.1016\/j.comnet.2026.112212_bib0087","series-title":"In: Stinson, D.R. (eds) Advances in Cryptology \u2013 CRYPTO\u00b4 93. CRYPTO 1994. Lecture Notes in Computer Science","article-title":"Broadcast encryption","volume":"773","author":"Fiat","year":"1993"},{"key":"10.1016\/j.comnet.2026.112212_bib0088","series-title":"In: Joux, A. (eds) Advances in Cryptology \u2013 EUROCRYPT 2009. EUROCRYPT 2009. Lecture Notes in Computer Science","article-title":"Adaptive security in broadcast encryption systems (with Short Ciphertexts)","volume":"5479","author":"Gentry","year":"2009"},{"key":"10.1016\/j.comnet.2026.112212_bib0089","series-title":"In: Canteaut, A., Ishai, Y. (eds) Advances in Cryptology \u2013 EUROCRYPT 2020. EUROCRYPT 2020. Lecture Notes in Computer Science","article-title":"Optimal broadcast encryption from pairings and LWE","volume":"12105","author":"Agrawal","year":"2020"},{"key":"10.1016\/j.comnet.2026.112212_bib0090","series-title":"In: Fischlin, M., Buchmann, J., Manulis, M. (eds) Public Key Cryptography \u2013 PKC 2012. PKC 2012. Lecture Notes in Computer Science","article-title":"Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model","volume":"7293","author":"Libert","year":"2012"},{"key":"10.1016\/j.comnet.2026.112212_bib0091","series-title":"rORAM: Efficient Range ORAM with O(log2N) Locality, in: Symposium on the Network and Distributed Systems Security, NDSS\u201919","author":"Chakraborti","year":"2019"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626002240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626002240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:37:06Z","timestamp":1775738226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626002240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":91,"alternative-id":["S1389128626002240"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112212","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A systematic review of secure coded caching","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112212","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"112212"}}