Multiaccess Coded Caching with Private Demands

05/13/2021 ∙ by Dequan Liang, et al. ∙ 0

Recently Hachem et al. formulated a multiaccess coded caching model which consists of a central server connected to K users via an error-free shared link, and K cache-nodes. Each cache-node is equipped with a local cache and each user can access L neighbouring cache-nodes with a cyclic wrap-around fashion. In this paper, we take the privacy of the users' demands into consideration, i.e., each user can only get its required file and can not get any information about the demands of other users. By storing some private keys at the cache-nodes, we propose a novel transformation approach to transform a non-private multiaccess coded caching scheme into a private multiaccess coded caching scheme.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.