Fundamental Limits of Caching With Secure Delivery

Abstract

Caching is emerging as a vital tool for alleviating the severe capacity crunch in modern content-centric wireless networks. The main idea behind caching is to store parts of popular content in end-users' memory and leverage the locally stored content to reduce peak data rates. By jointly designing content placement and delivery mechanisms, recent works have shown order-wise reduction in transmission rates in contrast to traditional methods. In this work, we consider the secure caching problem with the additional goal of minimizing information leakage to an external wiretapper. The fundamental cache memory vs. transmission rate trade-off for the secure caching problem is characterized. Rather surprisingly, these results show that security can be introduced at a negligible cost, particularly for large number of files and users. It is also shown that the rate achieved by the proposed caching scheme with secure delivery is within a constant multiplicative factor from the information-theoretic optimal rate for almost all parameter values of practical interest.

Demand-Private Coded Caching and the Exact Trade-off for N=K=2

“…Clearly, for D 1 ⊂ D 2 , a D 2 -non-private scheme is also a D 1 -non-private scheme. In particular, achievable rates for satisfying various demand type-classes were studied in [14], and their results are useful in our schemes for the type (K, K, · · · , K) due to the relation (12).…”

“…The coded caching schemes in the noiseless broadcast network is inherently prone to security and privacy issues since the broadcasted message is revealed to everyone. Information theoretic secrecy from an external adversary who can observe the broadcasted message was first studied by Sengupta et al [12]. They proposed a scheme which prevents the adversary from getting any information about any file from the broadcasted message.…”

Device-to-Device Secure Coded Caching

“…. , L. (22) Once user k joins the system, it caches the contentZ l k where l k = k mod L. Such allocation results in dividing the set of active users into ⌈ K L ⌉ virtual groups. In particular, we group the first L users to join the system in group 1, and the users from L + 1 to 2L in group 2 and so on.…”

Secure and Energy-Efficient Transmissions in Cache-Enabled Heterogeneous Cellular Networks: Performance Analysis and Optimization

“…This indicates that Ψ is a quasi-concave function of β s [40]. Hence, β * s is the unique zero-crossing of dΨ dβs , i.e., it is the solution to problem (28).…”

“…The secrecy throughput Ψ for the FOT scheme in(28) is quasi-concave on β s , and the optimal β * s maximizing Ψ is the unique zero-crossing of the following derivative dΨ dβs , It can be proved that the two boundaries are dΨ dβs | βs=0 = A 2 > 0 and dΨ dβs | βs→∞ < 0. Due to the continuity of Ψ, there is at least one zero-crossing of dΨ dβs…”