Weakly secure coded caching for N = U = 3 and α = {0, 1, 2}.

Weakly secure coded caching for N = U = 3 and α = {0, 1, 2}.

Source publication
Article
Full-text available
Coded caching is a promising method for solving caching problems in content-centric wireless networks. To enhance the security of coded caching for practical purposes, this paper investigates a secure coded caching scheme for defending against an eavesdropper who may possess prior knowledge before eavesdropping on content delivery. A novel key-base...

Context in source publication

Context 1
... achieve this key solution, some keys K j S must be stored during the placement phase. We use the following example to intuitively illustrate the key allocation performed in Algorithm 1. Example 1. Consider a case of N = 3 files and U = 3 users, as shown in Fig. 2. If we fix the cache gain at g = 1, then according to (2), the data memory will occupy F bits in the cache. Let the three files be n 1 = A, n 2 = B and n 3 = C. Each file is split into equally sized fragments, A = (A 1 , A 2 , A 3 ), B = (B 1 , B 2 , B 3 ) and C = (C 1 , C 2 , C 3 ), where all the fragments have an equal size of F/3 ...

Similar publications

Conference Paper
Full-text available
In this article, we study the scaling up of edge computing deployments. In edge computing, deployments are scaled up by adding more computational capacity atop the initial deployment, as deployment budgets allow. However, without careful consideration, adding new servers may not improve proximity to the mobile users, crucial for the Quality of Expe...