Multiaccess Coded Caching with Private Demands

Liang, Dequan; Wan, Kai; Cheng, Minquan; Caire, Giuseppe

doi:10.48550/arxiv.2105.06282

Cited by 2 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By using such transformation approach, the load K(1−LM/N ) KM/N +1 can be achieved for any system parameters K and L. For certain special cases of the 1D MACC parameters, some improved schemes with lower loads were proposed in [23]- [26]. Furthermore, some extended model of the 1D MACC problem has been studied, such as the privacy and secrecy constrains [27]- [29], the mobility-aware scenarios [30], and generalized 1D MACC topologies with the number of users is larger than that of cache-nodes [31]- [34].…”

Section: A Backgroundmentioning

confidence: 99%

Coded Caching for Two-Dimensional Multi-Access Networks

Zhang¹,

Wan²,

Cheng³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

This paper studies a novel multi-access coded caching (MACC) model in two-dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC model proposed by Hachem et al. We formulate a 2D MACC coded caching model, formed by a server containing N files, K 1 × K 2 cache-nodes with limited memory M which are placed on a grid with K 1 rows and K 2 columns, and K 1 ×K 2 cache-less users such that each user is connected to L 2 nearby cache-nodes. More precisely, for each row (or column), every user can access L consecutive cache-nodes, referred to as row (or column) 1D MACC problem in the 2D MACC model. The server is connected to the users through an error-free shared link, while the users can retrieve the cached content of the connected cache-nodes without cost.Our objective is to minimize the worst-case transmission load among all possible users' demands. In this paper, we propose a baseline scheme which directly extends an existing 1D MACC scheme to the 2D model by using a Minimum Distance Separable (MDS) code, and two improved schemes. In the first scheme referred to as grouping scheme, which works when K 1 and K 2 are divisible by L, we partition the cache-nodes and users into L 2 groups according to their positions, such that no two users in the same group share any cache-node, and we utilize the seminal shared-link coded caching scheme proposed by Maddah-Ali and Niesen for each group. Subsequently, for any model parameters satisfying min{K 1 , K 2 } > L we propose the second scheme, referred to as hybrid scheme, consisting in a highly non-trivial way to construct a 2D MACC scheme through a vertical and a horizontal 1D MACC schemes.

show abstract

Section: A Backgroundmentioning

confidence: 99%

Coded Caching for Two-Dimensional Multi-Access Networks

Zhang¹,

Wan²,

Cheng³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The idea of key superposition to guarantee both content security and demand privacy simultaneously was used in [20]. Demand privacy using privacy keys for the multi-access networks where each user has access to r caches in a cyclic wrap-around way [8] is considered in [21], [22]. But, the multi-access network we consider has number of users much larger than the number of caches.…”

Section: Introductionmentioning

confidence: 99%

“…It consists of a server having N files which is connected to K users, where each user has access to a unique set of r caches out of C caches. Demand privacy for single file retrieval is considered in [21], [22] whereas we consider security and demand privacy for linear function retrieval.…”

Section: Introductionmentioning

confidence: 99%

Security and Privacy in Cache-Aided Linear Function Retrieval for Multi-Access Coded Caching

Mallikharjuna

Rajan

2022

2022 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

A multi-access network consisting of N files, C caches, K users with each user having access to a unique set of r caches has been introduced recently by Muralidhar et al. ("Maddah-Ali-Niesen Scheme for Multi-access Coded Caching," in Proc. ITW, 2021). It considers Single File Retrieval (SFR) i.e, each user demands an arbitrary file from the server. It proposes a coded caching scheme which was shown to be optimal under the assumption of uncoded placement by Brunero and Elia ("Fundamental Limits of Combinatorial Multi-Access Caching" in arXiv:2110.07426 ). The above multi-access network is referred to as combinatorial topology which is considered in this work with three additional features : a) Linear Function Retrieval (LFR) i.e., each user is interested in retrieving an arbitrary linear combination of files in the server's library; b) Security i.e., the content of the library must be kept secure from an eavesdropper who obtains the signal sent by the server; c) Privacy i.e., each user can only get its required file and can not get any information about the demands of other users. Achievable Secure, Private LFR (SP-LFR) scheme, Secure LFR (S-LFR) scheme and Improved S-LFR scheme are proposed. As special cases, our work recovers some of the results by Yan and Tuninetti ("Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval," in Trans. Inf. Forensics and Security, 2021") and Sengupta et al.("Fundamental limits of caching with secure delivery," in Trans. Inf. Forensics and Security, 2015). At a memory point, M = r( C r ) C , the SP-LFR scheme is within a constant

show abstract

Multiaccess Coded Caching with Private Demands

Cited by 2 publications

References 19 publications

Coded Caching for Two-Dimensional Multi-Access Networks

Coded Caching for Two-Dimensional Multi-Access Networks

Security and Privacy in Cache-Aided Linear Function Retrieval for Multi-Access Coded Caching

Contact Info

Product

Resources

About