2011/06/10 by Ravi Tandon, Lalitha Sankar, Tandon, Ravi +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Diffusion and Search Dynamics #FOS: Computer and information sciences #Information Theory (cs.IT) #Privacy-Preserving Technologies in Data #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1106.2050
accepted for publication and presentation at ISIT 2011
arxiv created 2011/06/10 · openalex publication_date 2011/06/10 · arxiv updated 2011/06/13 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
The problem of preserving privacy when a multivariate source is required to be revealed partially to multiple users is modeled as a Gray-Wyner source coding problem with K correlated sources at the encoder and K decoders in which the kth decoder, k = 1, 2, ...,K, losslessly reconstructs the kth source via a common link and a private link. The privacy requirement of keeping each decoder oblivious of all sources other than the one intended for it is introduced via an equivocation constraint at each decoder such that the total equivocation summed over all decoders is E. The set of achievable rates-equivocation tuples is completely characterized. Using this characterization, two different definitions of common information are presented and are shown to be equivalent.