Secretive Coded Caching With Shared Caches

  title={Secretive Coded Caching With Shared Caches},
  author={Shreya Shrestha Meel and Balaji Sundar Rajan},
  journal={IEEE Communications Letters},
We consider the problem of secretive coded caching in a shared cache setup where the number of users accessing a particular helper cache is more than one, and every user can access exactly one helper cache. In secretive coded caching, the constraint of perfect secrecy must be satisfied. It requires that the users should not gain, either from their caches or from the transmissions, any information about the content of the files that they did not request from the server. In order to accommodate… 

Figures and Tables from this paper

A Secretive Coded Caching for Shared Cache Systems using PDAs
This paper proposes a procedure to obtain new secretive coded caching schemes for shared caches with reduced subpacketization levels and derives a lower bound on the secretive transmission rate using cut-set arguments and demonstrates the order-optimality of the proposed secretive coded caches scheme.


Fundamental limits of secretive coded caching
This paper introduces the problem of secretive coded caching where a user should not be able to learn anything, from either the content stored in its cache or the server transmissions, about a file it did not request.
Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching
The work derives the exact optimal worst-case delay and DoF, for a broad range of user-to-cache association profiles where each such profile describes how many users are helped by each cache.
Coded Placement for Systems with Shared Caches
This work presents an explicit caching scheme and fully characterize the coded placement gain for two-cache systems, and generalizes the scheme to larger networks, where the optimal parameters are characterized by solving a linear program.
Private Coded Caching
The problem of private coded caching is introduced where no user learns any information about the contents of the files it did not request from what is stored in its cache and the server transmissions and its order-optimality is demonstrated by deriving information-theoretic lower bounds.
Device-to-Device Secure Coded Caching
The work demonstrates the effectiveness of D2D communications in cache-aided systems even when confidentiality constraints are imposed at the participating nodes and against external eavesdroppers.
Fundamental limits of caching
This paper proposes a novel caching approach that can achieve a significantly larger reduction in peak rate compared to previously known caching schemes, and argues that the performance of the proposed scheme is within a constant factor from the information-theoretic optimum for all values of the problem parameters.
Secure Coded Caching with Colluding Users
  • K. Ma, Shuo Shao
  • Computer Science, Mathematics
    2021 Computing, Communications and IoT Applications (ComComAp)
  • 2021
This work identifies the inner bound of capacity region by proposing a coded caching scheme to achieve a low load secure data transmission and establishes outer bounds on the capacity region, which show that the proposed scheme is order optimal for a certain regime of parameters.
Fundamental Limits of Caching With Secure Delivery
The results show that security can be introduced at a negligible cost, particularly for large number of files and users, and it is shown that the rate achieved by the proposed caching scheme with secure delivery is within a constant multiplicative factor from the information-theoretic optimal rate.
Combination Networks With or Without Secrecy Constraints: The Impact of Caching Relays
This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users, and investigates a new model, where the intermediate relays employ caches in addition to the end users.
On the Information Ratio of Non-perfect Secret Sharing Schemes
It is proved that there exists a secret sharing scheme for every access function, and the known connections between matroids, polymatroids and perfect secret sharing schemes to the non-perfect case are extended.