Secretive Coded Caching with Shared Caches

We consider the problem of secretive coded caching in a shared cache setup where number users accessing particular xmlns:xlink="http://www.w3.org/1999/xlink">helper cache is more than one, and every user can access exactly one helper cache. In secretive caching, constraint xmlns:xlink="http://www.w3.org/1999/xlink">perfect secrecy must be satisfied. It requires that should not gain, either from their caches or transmissions, any information about content files they did request server. order to accommodate secrecy constraint, our requires, addition cache, dedicated xmlns:xlink="http://www.w3.org/1999/xlink">user minimum capacity 1 unit user. This formulation differs original work on (“Fundamental Limits Coded Caching With Multiple Antennas, Shared Caches Uncoded Prefetching” by E. Parrinello, A. Ünsal P. Elia Trans. Inf. Theory, 2020). this work, we propose secretively achievable caching scheme with under centralized placement. When applied setting, it matches Ravindrakumar xmlns:xlink="http://www.w3.org/1999/xlink">et al. (“Private Caching”, Forensics Security, 2018).