{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:46:29Z","timestamp":1759365989126,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science and Engineering Research Board (SERB) of the Department of Science and Technology (DST), Government of India"}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Entropy"],"abstract":"<jats:p>We consider combinatorial multi-access coded caching with private caches, where users are connected to two types of caches: private caches and multi-access caches. Each user has its own private cache, while multi-access caches are connected in the same way as caches are connected in a combinatorial topology. A scheme is proposed that satisfies the following three requirements simultaneously: (a) Linear Function Retrieval (LFR), (b) content security against an eavesdropper, and (c) demand privacy against a colluding set of users. It is shown that the private caches included in this work enable the proposed scheme to provide privacy against colluding users. For the same rate, our scheme requires less total memory accessed by each user and less total system memory than the existing scheme for multi-access combinatorial topology (no private caches) in the literature. We derive a cut-set lower bound and prove optimality when r\u2265C\u22121. For r&lt;C\u22121, we show a constant gap of 5 under certain conditions. Finally, the proposed scheme is extended to a more general setup where different users are connected to different numbers of multi-access caches, and multiple users are connected to the same subset of multi-access caches.<\/jats:p>","DOI":"10.3390\/e27101033","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T12:22:03Z","timestamp":1759321323000},"page":"1033","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Security, Privacy, and Linear Function Retrieval in Combinatorial Multi-Access Coded Caching with Private Caches"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2660-5844","authenticated-orcid":false,"given":"Mallikharjuna","family":"Chinnapadamala","sequence":"first","affiliation":[{"name":"Department of Electrical Communication Engineering, IISc, Bengaluru 560012, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7847-0200","authenticated-orcid":false,"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[{"name":"Department of Electrical Communication Engineering, IISc, Bengaluru 560012, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,1]]},"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","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"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Muralidhar, P.N., Katyal, D., and Rajan, B.S. (2021, January 17\u201321). Maddah-Ali-Niesen Scheme for Multi-access Coded Caching. Proceedings of the IEEE Information Theory Workshop, (ITW2021), Kanazawa, Japan.","DOI":"10.1109\/ITW48936.2021.9611394"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Reddy, K.S., and Karamchandani, N. (2018, January 16\u201319). On the Exact Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement. Proceedings of the 2018 International Conference on Signal Processing and Communications (SPCOM), Bangalore, India.","DOI":"10.1109\/SPCOM.2018.8724457"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Serbetci, B., Parrinello, E., and Elia, P. (2019, January 25\u201328). Multi-access coded caching: Gains beyond cache-redundancy. Proceedings of the IEEE Information Theory Workshop, Visby, Sweden.","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref_6","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_7","doi-asserted-by":"crossref","first-page":"2997","DOI":"10.1109\/TCOMM.2021.3053048","article-title":"Multi-Access Coded Caching Schemes From Cross Resolvable Designs","volume":"69","author":"Katyal","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1109\/TIT.2022.3193723","article-title":"Fundamental Limits of Combinatorial Multi-Access Caching","volume":"69","author":"Brunero","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"4001","DOI":"10.1109\/TIT.2021.3066005","article-title":"On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval","volume":"67","author":"Wan","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","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":"ref_11","unstructured":"Kamath, S. (2019). Demand private coded caching. arXiv."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Aravind, V.R., Sarvepalli, P.K., and Thangaraj, A. (2020, January 21\u201323). Subpacketization in Coded Caching with Demand Privacy. Proceedings of the 2020 National Conference on Communications (NCC), Kharagpur, India.","DOI":"10.1109\/NCC48643.2020.9055996"},{"key":"ref_13","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":"ref_14","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_15","doi-asserted-by":"crossref","first-page":"5250","DOI":"10.1109\/TIFS.2021.3127018","article-title":"Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval","volume":"16","author":"Yan","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_16","unstructured":"Namboodiri, K.K.K., and Rajan, B.S. (2022, January 10\u201313). Multi-Access Coded Caching with Demand Privacy. Proceedings of the IEEE Wireless Communications and Networking Conference, Austin, TX, USA."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Chinnapadamala, M., and Rajan, B.S. (2022, January 1\u20139). Security and Privacy in Cache-Aided Linear Function Retrieval for Multi-Access Coded Caching. Proceedings of the 2022 IEEE Information Theory Workshop (ITW), Mumbai, India.","DOI":"10.1109\/ITW54588.2022.9965900"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chinnapadamala, M., and Rajan, B.S. (2024, January 24\u201328). Security, Privacy and Linear Function Retrieval in Multi-Access Combinatorial Topology with Private Cache. Proceedings of the 2024 IEEE Information Theory Workshop (ITW), Shenzhen, China.","DOI":"10.1109\/ITW61385.2024.10806957"},{"key":"ref_20","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."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"63840","DOI":"10.1109\/ACCESS.2020.2982669","article-title":"Green and Secure Computation Offloading for Cache-Enabled IoT Networks","volume":"8","author":"Zahed","year":"2020","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/IOTM.001.2100062","article-title":"On Edge Caching in Satellite\u2014IoT Networks","volume":"4","author":"Ngo","year":"2021","journal-title":"IEEE Internet Things Mag."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5699","DOI":"10.1109\/TII.2020.3004352","article-title":"Energy-Efficient Content Placement with Coded Transmission in Cache-Enabled Hierarchical Industrial Internet of Things Networks","volume":"17","author":"Gu","year":"2021","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"9595","DOI":"10.1109\/TWC.2023.3272348","article-title":"Distributed Deep Multi-Agent Reinforcement Learning for Cooperative Edge Caching in Internet-of-Vehicles","volume":"22","author":"Zhou","year":"2023","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1109\/TII.2019.2938529","article-title":"Modeling and Analysis of a Shared Edge Caching System for Connected Cars and Industrial IoT-Based Applications","volume":"16","author":"Coutinho","year":"2020","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_26","unstructured":"Aruba Networks (2025, August 12). IoT Heading for Mass Adoption by 2019 Driven by Better-Than-Expected Business Results. arubanetworks.com. Available online: https:\/\/news.arubanetworks.com\/press-release\/arubanetworks\/iot-heading-mass-adoption-2019-driven-better-expected-business-results."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MIC.2021.3051675","article-title":"Security and Privacy in IoT Smart Healthcare","volume":"25","author":"Karunarathne","year":"2021","journal-title":"IEEE Internet Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.future.2018.09.017","article-title":"Design of secure key management and user authentication scheme for fog computing services","volume":"91","author":"Wazid","year":"2019","journal-title":"Futur. Gener. Comput. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1109\/JBHI.2017.2721545","article-title":"A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment","volume":"22","author":"Wazid","year":"2018","journal-title":"IEEE J. Biomed. Health Inform."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1134\/S1064226920120116","article-title":"An Information-Theoretic Approach for Reliable Distributed Storage Systems","volume":"65","author":"Kruglik","year":"2020","journal-title":"J. Commun. Technol. Electron."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","article-title":"The capacity of private information retrieval","volume":"63","author":"Sun","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Wang, Q., and Skoglund, M. (2018, January 17\u201322). Secure private information retrieval from colluding databases with eavesdroppers. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437848"},{"key":"ref_34","first-page":"2135","article-title":"Wiretap Channel II","volume":"63","author":"Ozarow","year":"1984","journal-title":"Bell Syst. Tech. J."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/10\/1033\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T12:24:37Z","timestamp":1759321477000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/10\/1033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":34,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["e27101033"],"URL":"https:\/\/doi.org\/10.3390\/e27101033","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]}}}