Robustness, Security, Privacy, and Linear Function Retrieval From Coded Servers for Users With Multiple-Cache Accessibility

Mallikharjuna Chinnapadamala

doi:10.1109/JIOT.2026.3658576

Return

Robustness, Security, Privacy, and Linear Function Retrieval From Coded Servers for Users With Multiple-Cache Accessibility

2026-01-28

PRE

Mallikharjuna Chinnapadamala

B. Sundar Rajan

DOI：10.1109/JIOT.2026.3658576

Original

Original request for help

Save

Abstract

En 中文

The model considered in this work consists of $H$ servers where the file library is maximum distance separable (MDS) coded and stored. Each server is connected to $K$ users through a dedicated shared link, and each user has access to a unique set of $r$ out of $C$ caches. For every set of $r$ caches, there is a user. Each user aims to retrieve an arbitrary linear combination of files. All the users should be able to retrieve their demands using the signals from any $L$ out of $H$ servers. In addition, the following conditions must be satisfied: 1) content security from an eavesdropper and 2) demand privacy against noncolluding users and any colluding set of servers. We propose two schemes, one of which satisfies both the above conditions and the other satisfies only the security condition. Over a certain range in the low memory region, our schemes are within a constant multiplicative factor from the optimal. As special cases, our schemes recover some of the previous works in the literature. One of our schemes is extended to a more general setup where different users are connected to different numbers of caches, and multiple users are connected to the same subset of caches.

Keywords:

Coded caching

linear function retrieval (LFR)

multiaccess

privacy

robustness

security