Name
Abstract | ||
|---|---|---|
We consider a K-receiver wiretap broadcast channel where K-w receivers are weak and have cache memories and K-s receivers are strong and have no cache memories. We derive an upper bound on the secrecy rate-memory tradeoff under a joint secrecy constraint and under decentralized caching. In contrast to previous works, prefetching in our scheme is purely decentralized and receivers randomly sample from a random key stream available at the transmitter and from the files in a library. For small cache sizes, the performance of our scheme improves with increasing length of the random key stream. For moderate and large cache sizes, a small key stream suffices to perform close to the information-theoretic limit of the system. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/GLOCOM.2018.8647549 | IEEE Global Communications Conference |
Field | DocType | ISSN |
Transmitter,Cache,Computer science,Upper and lower bounds,Secrecy,Computer network,Broadcast channels | Conference | 2334-0983 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarah Kamel | 1 | 1 | 1.37 |
| Michele A. Wigger | 2 | 337 | 38.25 |
| Mireille Sarkiss | 3 | 29 | 8.79 |