{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:29:59Z","timestamp":1760236199122,"version":"build-2065373602"},"reference-count":46,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T00:00:00Z","timestamp":1635897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The idea behind network caching is to reduce network traffic during peak hours via transmitting frequently-requested content items to end users during off-peak hours. However, due to limited cache sizes and unpredictable access patterns, this might not totally eliminate the need for data transmission during peak hours. Coded caching was introduced to further reduce the peak hour traffic. The idea of coded caching is based on sending coded content which can be decoded in different ways by different users. This allows the server to service multiple requests by transmitting a single content item. Research works regarding coded caching traditionally adopt a simple network topology consisting of a single server, a single hub, a shared link connecting the server to the hub, and private links which connect the users to the hub. Building on the results of Sengupta et al. (IEEE Trans. Inf. Forensics Secur., 2015), we propose and evaluate a yet more complex system model that takes into consideration both throughput and security via combining the mentioned ideas. It is demonstrated that the achievable rates in the proposed model are within a constant multiplicative and additive gap with the minimum secure rates.<\/jats:p>","DOI":"10.3390\/e23111459","type":"journal-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T17:59:38Z","timestamp":1635962378000},"page":"1459","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6691-0988","authenticated-orcid":false,"given":"Behrouz","family":"Zolfaghari","sequence":"first","affiliation":[{"name":"CSE Department, Indian Institute of Technology Guwahati, Guwahati 781039, Assam, India"},{"name":"Cyber Science Lab, School of Computer Science, University of Guelph, Guelph, ON N1G 2W1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikrant","family":"Singh","sequence":"additional","affiliation":[{"name":"EEE Department, Indian Institute of Technology Guwahati, Guwahati 781039, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brijesh Kumar","family":"Rai","sequence":"additional","affiliation":[{"name":"EEE Department, Indian Institute of Technology Guwahati, Guwahati 781039, Assam, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3301-0232","authenticated-orcid":false,"given":"Khodakhast","family":"Bibak","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Miami University, Oxford, OH 45056, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8994-729X","authenticated-orcid":false,"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, Tokyo 169-8050, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Niesen","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","unstructured":"Sengupta, A., Tandon, R., and Clancy, T.C. (July, January 29). Decentralized caching with secure delivery. Proceedings of the IEEE International Symposium on Information Theory, Honolulu, HI, USA."},{"key":"ref_3","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":"ref_4","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"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3753","DOI":"10.1109\/TCOMM.2019.2896026","article-title":"Coded caching in fog-ran: b-matching approach","volume":"67","author":"Bai","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/LCOMM.2019.2900237","article-title":"Reducing search complexity of coded caching by shrinking search space","volume":"23","author":"Cao","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1109\/LCOMM.2018.2820683","article-title":"Mds-coded caching leveraged by coordinated multi-point transmission","volume":"22","author":"Kim","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1524","DOI":"10.1109\/LCOMM.2018.2840149","article-title":"The transfer load-i\/o trade-off for coded caching","volume":"22","author":"Luo","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TIT.2017.2768517","article-title":"Coded caching under arbitrary popularity distributions","volume":"64","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3129","DOI":"10.1109\/TWC.2019.2911083","article-title":"Treating content delivery in multi-antenna coded caching as general message sets transmission: A dof region perspective","volume":"18","author":"Cao","year":"2019","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1109\/TWC.2017.2768361","article-title":"Scalable content delivery with coded caching in multi-antenna fading channels","volume":"17","author":"Ngo","year":"2018","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4347","DOI":"10.1109\/TIT.2018.2805331","article-title":"Coded caching and content delivery with heterogeneous distortion requirements","volume":"64","author":"Yang","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TWC.2018.2879358","article-title":"Optimizing mds coded caching in wireless networks with device-to-device communication","volume":"18","author":"Pedersen","year":"2019","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2792","DOI":"10.1109\/TIT.2018.2888615","article-title":"Physical-layer schemes for wireless coded caching","volume":"65","author":"Shariatpanahi","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCOMM.2017.2746106","article-title":"Coded caching for wireless backhaul networks with unequal link rates","volume":"66","author":"Tang","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/s11107-015-0570-7","article-title":"Universal caching model and markov-based cache analysis for information centric networks","volume":"30","author":"Panigrahi","year":"2015","journal-title":"Photonic Netw. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4166","DOI":"10.1109\/TCOMM.2019.2901686","article-title":"Constructions of coded caching schemes with flexible memory size","volume":"67","author":"Cheng","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5755","DOI":"10.1109\/TIT.2018.2847679","article-title":"Centralized coded caching schemes: A hypergraph theoretical approach","volume":"64","author":"Shangguan","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/JSAC.2018.2844959","article-title":"A novel centralized coded caching scheme with coded prefetching","volume":"36","year":"2018","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3388","DOI":"10.1109\/TCOMM.2019.2893942","article-title":"Placement delivery array design for coded caching scheme in d2d networks","volume":"67","author":"Wang","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"4683","DOI":"10.1109\/TCOMM.2019.2906305","article-title":"An approximation algorithm for optimal clique cover delivery in coded caching","volume":"67","author":"Asghari","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"72803","DOI":"10.1109\/ACCESS.2019.2920083","article-title":"Delivery design for coded caching over wireless multicast networks","volume":"7","author":"Zheng","year":"2019","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/JSAC.2018.2844958","article-title":"Fundamental limits of coded caching: From uncoded prefetching to coded prefetching","volume":"36","author":"Zhang","year":"2018","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TWC.2018.2878845","article-title":"Achieving spatial scalability for coded caching via coded multipoint multicasting","volume":"18","author":"Bayat","year":"2019","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Vettigli, G., Ji, M., Shanmugam, K., Llorca, G., Tulino, A.M., and Caire, G. (2019). Efficient algorithms for coded multicasting in heterogeneous caching networks. Entropy, 21.","DOI":"10.3390\/e21030324"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3354","DOI":"10.1109\/TCOMM.2018.2815017","article-title":"Joint multicast and unicast beamforming for coded caching","volume":"66","author":"Zhong","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/JSAC.2018.2844622","article-title":"Utility optimal scheduling for coded caching in general topologies","volume":"36","author":"Combes","year":"2018","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"7264","DOI":"10.1109\/TCOMM.2019.2916556","article-title":"Error correction in coded caching with symmetric batch prefetching","volume":"67","author":"Karat","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TMC.2018.2832636","article-title":"Coded caching clusters with device-to-device communications","volume":"18","author":"Barreal","year":"2019","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"5321","DOI":"10.1109\/TCOMM.2019.2914393","article-title":"Coded caching for heterogeneous systems: An optimization perspective","volume":"67","author":"Ibrahim","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, J., Lin, X., Wang, C.-C., and Wang, X. (2015, January 14\u201319). Coded caching for files with distinct file sizes. Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282743"},{"key":"ref_32","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":"ref_33","first-page":"221","article-title":"Coded caching with nonuniform demands","volume":"63","author":"Niesen","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ding, Y., Wang, L., Wu, H., Shen, H.V., and Poor, X. (2018, January 20\u201324). Tradeoff of content sharing efficiency and secure transmission in coded caching systems. Proceedings of the IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422139"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Kiskani, M.K., and Sadjadpour, H.R. (2018, January 26\u201329). Secure coded caching in wireless ad hoc networks. Proceedings of the International Conference on Computing, Networking and Communications (ICNC), Silicon Valley, CA, USA.","DOI":"10.1109\/ICCNC.2017.7876159"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Zewail, A.A., and Yener, A. (2016, January 17\u201319). Coded caching for resolvable networks with security requirements. Proceedings of the IEEE Conference on Communications and Network Security (CNS): The Workshop on Physical-Layer Methods for Wireless Security, Philadelphia, PA, USA.","DOI":"10.1109\/CNS.2016.7860560"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Kamel, M., Wigger, S., and Sarkiss, M. (2018, January 9\u201313). Decentralized coded caching for wiretap broadcast channels. Proceedings of the IEEE Global Communications Conference (GLOBECOM), Abu Dhabi, United Arab Emirates.","DOI":"10.1109\/GLOCOM.2018.8647549"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Suthan, I., Chugh, C.H.H., and Krishnan, P. (2017, January 6\u201310). An improved secretive coded caching scheme exploiting common demands. Proceedings of the IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan.","DOI":"10.1109\/ITW.2017.8277998"},{"key":"ref_39","first-page":"3108","article-title":"Coded caching for multi-level popularity and access","volume":"63","author":"Hachem","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"7018","DOI":"10.1109\/TIT.2017.2733527","article-title":"Information-theoretic caching: The multi-user case","volume":"63","author":"Lim","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Sengupta, A., Tandom, R., and Clancy, T.C. (2015, January 14\u201319). Improved approximation of storage-rate tradeoff for caching via new outer bounds. Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China.","DOI":"10.1109\/ISIT.2015.7282744"},{"key":"ref_42","unstructured":"Vijit, K.K.P., Rai, B.K., and Jacob, T. (2019, January 20\u201323). Towards the exact rate memory tradeoff in coded caching. Proceedings of the National Conference on Communications (NCC), Bangalore, India."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Wei, Y., and Ulukus, S. (2017, January 3\u20136). Coded caching with multiple file requests. Proceedings of the 55th Annual Allerton Conference on Communication, Control and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2017.8262770"},{"key":"ref_44","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":"Niesen","year":"2015","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Wei, Y., and Ulukus, S. (2017, January 6\u201310). Novel decentralized coded caching through coded prefetching. Proceedings of the 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan.","DOI":"10.1109\/ITW.2017.8278044"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1459\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:25:05Z","timestamp":1760167505000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,3]]},"references-count":46,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["e23111459"],"URL":"https:\/\/doi.org\/10.3390\/e23111459","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,11,3]]}}}