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.

References in corpus (1)

• Fundamental Limits of Caching in Wireless D2D Networks

Cited by in corpus (28)

• Fog-Aided Wireless Networks for Content Delivery: Fundamental Latency Trade-Offs
• Order-Optimal Rate of Caching and Coded Multicasting with Random Demands
• Information-Theoretic Caching: Sequential Coding for Computing
• A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
• Demand Private Coded Caching
• Information Theoretic Caching: The Multi-User Case
• Subpacketization in Coded Caching with Demand Privacy
• Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
• Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval
• Improved Lower Bounds for Coded Caching
• Fundamental Limits of Caching for Demand Privacy against Colluding Users
• Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
• Secure and Energy-Efficient Transmissions in Cache-Enabled Heterogeneous Cellular Networks: Performance Analysis and Optimization
• On Secure Coded Caching via Combinatorial Method
• Linear Coded Caching Scheme for Centralized Networks
• A framework of constructing placement delivery arrays for centralized coded caching
• Cache-Enabled Physical-Layer Security for Video Streaming in Wireless Networks with Limited Backhaul
• Coded Caching in the Presence of a Wire and a Cache Tapping Adversary of Type II
• Physical-Layer Security in Cache-Enabled Cooperative Small Cell Networks Against Randomly Distributed Eavesdroppers
• QoE-driven Secure Video Transmission in Cloud-edge Collaborative Networks
• Improved Constructions of Coded Caching Schemes for Combination Networks
• Coded Caching Schemes with Linear Subpacketizations
• Decentralized Caching Schemes and Performance Limits in Two-layer Networks
• Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers
• A Secretive Coded Caching for Shared Cache Systems using PDAs
• Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks
• Edge-Caching Wireless Networks: Performance Analysis and Optimization
• New coded caching schemes from placement delivery arrays