2023/09/16 by Amirreza Zamani, Zamani, Amirreza, Tobias J. Oechtering +3
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Privacy-Preserving Technologies in Data
paper · pdf · doi:10.48550/arxiv.2309.09033
openalex publication_date 2023/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The design of a statistical signal processing privacy problem is studied where the private data is assumed to be observable. In this work, an agent observes useful data Y, which is correlated with private data X, and wants to disclose the useful information to a user. A statistical privacy mechanism is employed to generate data U based on (X,Y) that maximizes the revealed information about Y while satisfying a privacy criterion. To this end, we use extended versions of the Functional Representation Lemma and Strong Functional Representation Lemma and combine them with a simple observation which we call separation technique. New lower bounds on privacy-utility trade-off are derived and we show that they can improve the previous bounds. We study the obtained bounds in different scenarios and compare them with previous results.