Show simple item record

dc.contributor.authorBahrami, Mohsen
dc.contributor.authorAttia, Mohamed Adel
dc.contributor.authorTandon, Ravi
dc.contributor.authorVasic, Bane
dc.date.accessioned2018-06-11T22:53:55Z
dc.date.available2018-06-11T22:53:55Z
dc.date.issued2017
dc.identifier.citationM. Bahrami, M. A. Attia, R. Tandon and B. Vasić, "Towards the exact rate-memory trade-off for uncoded caching with secure delivery," 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2017, pp. 878-885. doi: 10.1109/ALLERTON.2017.8262831en_US
dc.identifier.issn2474-0195
dc.identifier.doi10.1109/ALLERTON.2017.8262831
dc.identifier.urihttp://hdl.handle.net/10150/627928
dc.description.abstractWe 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.en_US
dc.description.sponsorshipNSF [CAREER 1651492]en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.urlhttp://ieeexplore.ieee.org/document/8262831/en_US
dc.rightsCopyright © 2017, IEEE.en_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.titleTowards the Exact Rate-Memory Trade-off for Uncoded Caching with Secure Deliveryen_US
dc.typeArticleen_US
dc.contributor.departmentUniv Arizona, Dept Elect & Comp Engnen_US
dc.identifier.journal2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)en_US
dc.description.collectioninformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US
dc.source.beginpage878
dc.source.endpage885
refterms.dateFOA2018-06-11T22:53:56Z


Files in this item

Thumbnail
Name:
Towards_the_Exact_Rate_Memory_ ...
Size:
436.9Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record