Device-to-Device Private Caching with Trusted Server

@article{Wan2020DevicetoDevicePC,
  title={Device-to-Device Private Caching with Trusted Server},
  author={Kai Wan and Hua Sun and Mingyue Ji and Daniela Tuninetti and G. Caire},
  journal={ICC 2020 - 2020 IEEE International Conference on Communications (ICC)},
  year={2020},
  pages={1-6}
}
  • Kai Wan, Hua Sun, +2 authors G. Caire
  • Published 2020
  • Computer Science, Mathematics
  • ICC 2020 - 2020 IEEE International Conference on Communications (ICC)
In order to preserve the privacy of the users demands from other users, in this paper we formulate a novel information theoretic Device-to-Device (D2D) private caching model by adding a trusted server. In the delivery phase, the trusted server collects the users demands and sends a query to each user, who then broadcasts packets according to this query. Two D2D private caching schemes (uncoded and coded) are proposed in this paper, which are shown to be order optimal. 

Figures from this paper

Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server
TLDR
The main contribution of this paper is a novel converse bound for the studied model where users may collude and yet cannot infer what files the remaining users have demanded, which is the first that genuinely accounts for the demand privacy constraint. Expand
Fundamental Limits of Demand-Private Coded Caching
TLDR
It is demonstrated that, the memoryrate pair (M,min{N,K}(1 −M/N)), which is achievable for non-private schemes with uncoded transmissions, is also achievable under demand privacy. Expand
Improved Memory-Rate Trade-off for Caching with Demand Privacy
TLDR
The memory- rate trade-off achieved using this scheme is shown to be within a multiplicative factor of 3 from the optimal for all the memory regimes when K < N. Expand
A New Design Framework on Device-to-Device Coded Caching with Optimal Rate and Significantly Less Subpacketizations
TLDR
A new design framework on Device-to-Device (D2D) coded caching networks with optimal rate but significantly less file subpacketizations compared to that of the well-known D2D coded caching scheme proposed by Ji, Caire and Molisch (JCM). Expand
Towards Finite File Packetizations in Wireless Device-to-Device Caching Networks
TLDR
Two combinatorial approaches of D2D coded caching network design with reduced packetizations and desired throughput gain compared to the conventional uncoded unicasting are presented and an exponential reduction of packetizations is yielded while providing a per-user throughput that is comparable to the state-of-the-art designs in the literature. Expand
Cache-aided Multiuser Private Information Retrieval
TLDR
The product design embeds the well-known Sun-Jafar PIR scheme into coded caching, in order to benefit from the coded caching gain while preserving the privacy of the users’ demands. Expand
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching
TLDR
A novel MuPIR scheme inspired by the Maddah-Ali and Niesen (MAN) coded caching scheme is proposed, which achieves lower load than any existing schemes, especially the product design (PD), and is shown to be optimal within a factor of 8 in general and exactly optimal at very high or low memory regime. Expand
Private Cache-aided Interference Alignment for Multiuser Private Information Retrieval
TLDR
It is proved that the proposed scheme is optimal if the cache placement is uncoded (i.e., users directly cache a subset of the library bits) and in general when $N=2,3$. Expand
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval
TLDR
The proposed novel scheme is linear, based on MAN uncoded cache placement, and leverages ideas from interference alignment, and it is shown that the proposed scheme works not only on arbitrary finite field, but also on any commutative ring. Expand
Private Information Delivery
We introduce the problem of private information delivery (PID), comprised of K messages, a user, and N servers (each holds M ≤ K messages) that wish to deliver one out of K messages to the userExpand
...
1
2
...

References

SHOWING 1-10 OF 30 REFERENCES
Subpacketization in Coded Caching with Demand Privacy
TLDR
This work considers coded caching schemes that assure privacy for user demands with a particular focus on reducing subpacketization for the 2-user, 2-file case, and presents a new linear demand-private scheme with the lowest possible sub packetization. Expand
Demand Private Coded Caching
TLDR
The problem of demand private coded caching where no user learns any information about the demands of other users is introduced and an achievable scheme is provided and its performance is compared using the existing lower bounds on the achievable rates under no privacy setting. Expand
Coded Caching with Private Demands
  • Kai Wan, G. Caire
  • Computer Science, Mathematics
  • 2020 Information Theory and Applications Workshop (ITA)
  • 2020
TLDR
A private caching scheme based on Maximum Distance Separable (MDS) code with the same sub-packetization level as the MAN scheme, which is order optimal for high memory regime and relaxing the information theoretic privacy constraint is proposed. Expand
A content-delivery protocol, exploiting the privacy benefits of coded caching
  • Felix Engelmann, P. Elia
  • Computer Science
  • 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
  • 2017
TLDR
This work presents a step-by-step privacy-aware content-delivery protocol that utilizes caching and which can safeguard against unauthorized matching of users to their requests, as well as against unauthorized knowledge of the popularity statistics of files; both crucial privacy issues in different scenarios such as video on demand. Expand
Demand-Private Coded Caching and the Exact Trade-off for N=K=2
TLDR
This paper first shows that the memory-rate pair (M, min{ N, K}(1- M / N) is achievable under information theoretic demand privacy, while using broadcast transmissions, and shows that perfectly demand-private coded caching rate is order optimal for all parameter regimes. Expand
Fundamental Limits of Caching in Wireless D2D Networks
TLDR
A caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands are proposed. Expand
Private information retrieval schemes for codec data with arbitrary collusion patterns
TLDR
The effectiveness of previous strategies in this new scenario of the database being encoded across several servers is investigated, and new results in the case where the servers are partitioned into disjoint colluding groups are presented. Expand
On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot Delivery
TLDR
This work derives both the minimum average and the minimum worst-case sum-load of the D2D transmissions, for given individual cache memory size at disposal of each user, and proposes an extension of the presented scheme that provides robustness against random user inactivity. Expand
On Coded Caching With Private Demands
  • Kai Wan, G. Caire
  • Computer Science
  • IEEE Transactions on Information Theory
  • 2021
TLDR
This paper designs a two-phase private caching scheme with minimum load while preserving the information-theoretic privacy of the demands of each user with respect to other users, and introduces a number of virtual users for the virtual-user scheme. Expand
On the optimality of uncoded cache placement
TLDR
This paper connects the caching problem to an index coding problem and shows the optimality of the MAN scheme under the conditions that (i) the cache placement phase is restricted to be uncoded (i.e, pieces of the files can only copied into the user's cache), and (ii) the number of users is no more than theNumber of files. Expand
...
1
2
3
...