TY - GEN
T1 - Towards the exact rate-memory trade-off for uncoded caching with secure delivery
AU - Bahrami, Mohsen
AU - Attia, Mohamed Adel
AU - Tandon, Ravi
AU - Vasić, Bane
N1 - Funding Information:
The work of M. Attia and R. Tandon was supported by the NSF grant CAREER 1651492.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - We consider the problem of secure delivery in a single-hop caching network with a central server connected to multiple end-users via an insecure multi-cast link. The server has a database of a set of files (content) and each user, which is equipped with a local cache memory, requests access one of the files. In addition to delivering users' requests, the server needs to keep the files (information-theoretically) secure from an external eavesdropper observing the underlying communications between the server and users. We focus on an important class of content placement strategies where the pre-fetching is required to be uncoded and caches are filled with uncoded fragments of files. In this paper, we establish the exact characterization of secure rate-memory trade-off for the worst-case communication rate through a matching converse under the constraint of uncoded cache placement where the number of users is no larger than the number of files in the database.
AB - We consider the problem of secure delivery in a single-hop caching network with a central server connected to multiple end-users via an insecure multi-cast link. The server has a database of a set of files (content) and each user, which is equipped with a local cache memory, requests access one of the files. In addition to delivering users' requests, the server needs to keep the files (information-theoretically) secure from an external eavesdropper observing the underlying communications between the server and users. We focus on an important class of content placement strategies where the pre-fetching is required to be uncoded and caches are filled with uncoded fragments of files. In this paper, we establish the exact characterization of secure rate-memory trade-off for the worst-case communication rate through a matching converse under the constraint of uncoded cache placement where the number of users is no larger than the number of files in the database.
UR - http://www.scopus.com/inward/record.url?scp=85048006579&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048006579&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2017.8262831
DO - 10.1109/ALLERTON.2017.8262831
M3 - Conference contribution
AN - SCOPUS:85048006579
T3 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
SP - 878
EP - 885
BT - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Y2 - 3 October 2017 through 6 October 2017
ER -