Multi-user privacy: The Gray-Wyner system and generalized common information

Ravi Tandon; Lalitha Sankar; H. Vincent Poor

doi:10.1109/ISIT.2011.6034191

Multi-user privacy: The Gray-Wyner system and generalized common information

Ravi Tandon, Lalitha Sankar, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Scopus citations

Abstract

The problem of preserving privacy when a multi-variate 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 k^th decoder, k = 1, 2, ⋯, K, losslessly reconstructs the k^th source via a common link of rate R₀ and a private link of rate R_k. The privacy requirement of keeping each decoder oblivious of all sources other than the one intended for it is introduced via an equivocation constraint E_k at decoder k such that the total equivocation summed over all decoders E ≥ Δ. The set of achievable (R_k}^K_k=1,R₀, Δ) rates-equivocation (K + 2)-tuples is completely characterized. Using this characterization, two different definitions of common information are presented and are shown to be equivalent.

Original language	English (US)
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	563-567
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6034191
State	Published - Oct 26 2011
Externally published	Yes
Event	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: Jul 31 2011 → Aug 5 2011

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8104

Other

Other	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/Territory	Russian Federation
City	St. Petersburg
Period	7/31/11 → 8/5/11

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2011.6034191

Cite this

Multi-user privacy: The Gray-Wyner system and generalized common information. / Tandon, Ravi; Sankar, Lalitha; Vincent Poor, H.
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 563-567 6034191 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tandon, R, Sankar, L & Vincent Poor, H 2011, Multi-user privacy: The Gray-Wyner system and generalized common information. in 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011., 6034191, IEEE International Symposium on Information Theory - Proceedings, pp. 563-567, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 7/31/11. https://doi.org/10.1109/ISIT.2011.6034191

@inproceedings{8acbf351d39b47e998360c1984727fac,

title = "Multi-user privacy: The Gray-Wyner system and generalized common information",

abstract = "The problem of preserving privacy when a multi-variate 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 of rate R0 and a private link of rate Rk. The privacy requirement of keeping each decoder oblivious of all sources other than the one intended for it is introduced via an equivocation constraint Ek at decoder k such that the total equivocation summed over all decoders E ≥ Δ. The set of achievable (Rk}Kk=1,R0, Δ) rates-equivocation (K + 2)-tuples is completely characterized. Using this characterization, two different definitions of common information are presented and are shown to be equivalent.",

author = "Ravi Tandon and Lalitha Sankar and {Vincent Poor}, H.",

year = "2011",

month = oct,

day = "26",

doi = "10.1109/ISIT.2011.6034191",

language = "English (US)",

isbn = "9781457705953",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "563--567",

booktitle = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

TY - GEN

T1 - Multi-user privacy

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

AU - Tandon, Ravi

AU - Sankar, Lalitha

AU - Vincent Poor, H.

PY - 2011/10/26

Y1 - 2011/10/26

N2 - The problem of preserving privacy when a multi-variate 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 of rate R0 and a private link of rate Rk. The privacy requirement of keeping each decoder oblivious of all sources other than the one intended for it is introduced via an equivocation constraint Ek at decoder k such that the total equivocation summed over all decoders E ≥ Δ. The set of achievable (Rk}Kk=1,R0, Δ) rates-equivocation (K + 2)-tuples is completely characterized. Using this characterization, two different definitions of common information are presented and are shown to be equivalent.

AB - The problem of preserving privacy when a multi-variate 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 of rate R0 and a private link of rate Rk. The privacy requirement of keeping each decoder oblivious of all sources other than the one intended for it is introduced via an equivocation constraint Ek at decoder k such that the total equivocation summed over all decoders E ≥ Δ. The set of achievable (Rk}Kk=1,R0, Δ) rates-equivocation (K + 2)-tuples is completely characterized. Using this characterization, two different definitions of common information are presented and are shown to be equivalent.

UR - http://www.scopus.com/inward/record.url?scp=80054816651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054816651&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6034191

DO - 10.1109/ISIT.2011.6034191

M3 - Conference contribution

AN - SCOPUS:80054816651

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 563

EP - 567

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

Multi-user privacy: The Gray-Wyner system and generalized common information

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this