Multi-library coded caching with partial secrecy

Michèle Wigger (1, 2) , Mireille Sarkiss (3, 4, 5)

1 COMNUM - Communications Numériques
2 COMELEC - Département Communications & Electronique
3 IP Paris - Institut Polytechnique de Paris
4 TSP - CITI - Communications, Images et Traitement de l'Information
5 ISTeC-SAMOVAR - Information, Signal et Technologies des Communications

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 rate-memory tradeoff for systems with K = 2 or K = 3 receivers. Our bounds are tight in some regimes and show that the standard (non-secure) coded caching upper bound can be approached for a wide range of parameters. In some cases, the proposed upper bound on the secrecy rate-memory 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.

Mots clés: Lower Bound; Upper Bound; Remote Memory; Secret Key; Content Popularity; Content Caching; Delivery Phase

Domaines: Théorie de l'information [cs.IT]

Michèle Wigger, Mireille Sarkiss. Multi-library coded caching with partial secrecy. 2019 IEEE Information Theory Workshop (ITW), Aug 2019, Visby, Sweden. ⟨10.1109/ITW44776.2019.8989309⟩. ⟨hal-02440877⟩