Improving Achievability of Cache-Aided Private Variable-Length Coding with Zero Leakage

A statistical cache-aided compression problem with a privacy constraint is studied, where a server has access to a database of N files, (Y_{1},\ \ldots,\ Y_{N}) , each of size F bits and is linked through a shared channel to K users, where each has access to a local cache memory of size MF bits. Dur...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks pp. 218 - 224
Main Authors: Zamani, Amirreza, Skoglund, Mikael
Format: Conference Proceeding
Language:English
Published: International Federation for Information Processing - IFIP 21.10.2024
Subjects:
Cache-aided networks
Couplings
Data models
Data privacy
Encoding
Entropy
Greedy algorithms
minimum entropy functional representation
Optimization
private variable-length coding
Servers
Wireless networks
ISSN:2690-3342
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A statistical cache-aided compression problem with a privacy constraint is studied, where a server has access to a database of N files, (Y_{1},\ \ldots,\ Y_{N}) , each of size F bits and is linked through a shared channel to K users, where each has access to a local cache memory of size MF bits. During the placement phase, the server fills the users' caches without prior knowledge of their demands, while the delivery phase takes place after the users send their demands to the server. We assume that each file in database Y_{i} is arbitrarily correlated with a private attribute X , and an adversary is assumed to have access to the shared channel. The users and the server have access to a shared key W . The goal is to design the cache contents and the delivered message \mathcal{C} such that the average length of \mathcal{C} is minimized, while satisfying: \mathbf{i} . The response \mathcal{C} does not reveal any information about X , i.e., I(X;\mathcal{C})=0 ; ii. User i can decode its demand, Y_{d_{i}} , by using the shared key W, \mathcal{C} , and its local cache Z_{i} . In a previous work, we have proposed a variable-length coding scheme that combines privacy-aware compression with coded caching techniques. In this paper, we propose a new achievability scheme using minimum entropy coupling concept and a greedy entropy-based algorithm. We show that the proposed scheme improves the previous results. Moreover, considering two special cases we improve the obtained bounds using the common information concept.
ISSN:2690-3342