2023/10/29 by Amirreza Zamani, Zamani, Amirreza, Tobias J. Oechtering +3 · 1 citation
Computer Science · Engineering · #Cooperative Communication and Network Coding #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2310.19122
openalex publication_date 2023/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A private compression design problem is studied, where an encoder observes useful data Y, wishes to compress it using variable length code and communicates it through an unsecured channel. Since Y is correlated with private data X, the encoder uses a private compression mechanism to design encoded message \cal C and sends it over the channel. An adversary is assumed to have access to the output of the encoder, i.e., \cal C, and tries to estimate X. Furthermore, it is assumed that both encoder and decoder have access to a shared secret key W. In this work, we generalize the perfect privacy (secrecy) assumption and consider a non-zero leakage between the private data X and encoded message \cal C. The design goal is to encode message \cal C with minimum possible average length that satisfies non-perfect privacy constraints. We find upper and lower bounds on the average length of the encoded message using different privacy metrics and study them in special cases. For the achievability we use two-part construction coding and extended versions of Functional Representation Lemma. Lastly, in an example we show that the bounds can be asymptotically tight.