Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Proactive Coded Caching Scheme for D2D Networks

Qiaoling Zhang, Changlu Lin, Minquan Cheng

TL;DR

A secure coded caching scheme for D2D networks that guarantees both file privacy and secure delivery is proposed and it is demonstrated that the proposed scheme achieves order-optimal performance when the file size is sufficiently large and the cache memory is ample.

Abstract

Coded caching and device-to-device (D2D) communication are two effective techniques for alleviating network traffic. Secure transmission and file privacy have also become critical concerns in these domains. However, prevailing coded caching schemes typically assume that a user's cached content is inaccessible to others, overlooking the risk of file privacy leakage due to attacks targeting the cache itself. In this paper, we propose a secure coded caching scheme for D2D networks that guarantees both file privacy and secure delivery. We demonstrate that the proposed scheme achieves order-optimal performance when the file size is sufficiently large and the cache memory is ample.

Proactive Coded Caching Scheme for D2D Networks

TL;DR

A secure coded caching scheme for D2D networks that guarantees both file privacy and secure delivery is proposed and it is demonstrated that the proposed scheme achieves order-optimal performance when the file size is sufficiently large and the cache memory is ample.

Abstract

Coded caching and device-to-device (D2D) communication are two effective techniques for alleviating network traffic. Secure transmission and file privacy have also become critical concerns in these domains. However, prevailing coded caching schemes typically assume that a user's cached content is inaccessible to others, overlooking the risk of file privacy leakage due to attacks targeting the cache itself. In this paper, we propose a secure coded caching scheme for D2D networks that guarantees both file privacy and secure delivery. We demonstrate that the proposed scheme achieves order-optimal performance when the file size is sufficiently large and the cache memory is ample.
Paper Structure (20 sections, 2 theorems, 52 equations, 2 figures, 1 table)

This paper contains 20 sections, 2 theorems, 52 equations, 2 figures, 1 table.

Table of Contents

  1. INTRODUCTION
  2. SYSTEM MODEL
  3. Placement Phase
  4. Delivery Phase
  5. System Constraints
  6. MAIN RESULTS
  7. Placement Phase
  8. Prefetching Stage
  9. Renewal Stage
  10. Delivery Phase
  11. Achievability
  12. Example
  13. Placement Phase
  14. Prefetching Stage
  15. Renewal Stage
  16. ...and 5 more sections

Key Result

Theorem 1

For an $(U,M,N)$ D2D proactive caching system described in Section sec-system, there exists a scheme achieving the following memory-load pairs: where $l\in[1,U-1]$.

Figures (2)

  • Figure 1: The $(U,M,N)$ D2D proactive caching system
  • Figure 2: Comparison between the required transmission load under different system requirements for $N=U=20$.

Theorems & Definitions (9)

  • Definition 1: Proactive coded caching scheme
  • Definition 2: DH problem DH1976
  • Definition 3: Ramp secret sharing scheme DLW2021,M2018
  • Example 1
  • Theorem 1
  • Remark 1
  • Remark 2
  • Example 2
  • Lemma 1: Theorem 1 in ZIY20192