Multilibrary Coded Caching with Partial Secrecy The paper considers a coded caching setup with two libraries and where only one of them needs to be kept secret from an external eavesdropper. We provide upper and lower bounds on the secrecy ratememory tradeoff for systems with mathsfK  2 or mathsfK  3 receivers. Our bounds are tight in some regimes and show that the standard (nonsecure) coded caching upper bound can be approached for a wide range of parameters. In some cases, the proposed upper bound on the secrecy ratememory tradeoff is even lower than the lower bound for standard coded caching. The reason is that in our setup the ratio of receivers requesting secure files over those requesting nonsecure files is fixed and known to everyone in advance. The transmitter can thus adjust the contents stored in the cache memories to this ratio.

Multiaccess coded caching: gains beyond cacheredundancy The work considers the Kuser cacheaided shared link broadcast channel where each user has access to exactly z caches of normalized size xcexb3, and where each cache assists exactly z users. For this setting, for two opposing memory regimes, we propose novel caching and coded delivery schemes which maximize the local caching gain, and achieve a coding gain larger than  1Kgamma (users served at a time) despite the fact that the total cache redundancy remains  Kgamma irrespective of z. Interestingly, when z  fracK1Kgamma, the derived optimal coding gain is Kgamma z1, matching the performance of a hypothetical scenario where each user has its own dedicated cache of size zgamma.