2020
DOI: 10.1109/tifs.2019.2954652
|View full text |Cite
|
Sign up to set email alerts
|

Data Disclosure Under Perfect Sample Privacy

Abstract: Perfect data privacy seems to be in fundamental opposition to the economical and scientific opportunities associated with extensive data exchange. Defying this intuition, this paper develops a framework that allows the disclosure of collective properties of datasets without compromising the privacy of individual data samples. We present an algorithm to build an optimal disclosure strategy/mapping, and discuss it fundamental limits on finite and asymptotically large datasets. Furthermore, we present explicit ex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
3
1

Relationship

3
7

Authors

Journals

citations
Cited by 27 publications
(19 citation statements)
references
References 34 publications
0
19
0
Order By: Relevance
“…Efficient algorithms to compute these quantities are discussed in Ref. [ 26 ]. Although current implementations allow only relatively small systems, this line of thinking shows that future advances in PID might make the computation of emergence indices more scalable, avoiding the limitations of Eq (10) .…”
Section: Measuring Emergencementioning
confidence: 99%
“…Efficient algorithms to compute these quantities are discussed in Ref. [ 26 ]. Although current implementations allow only relatively small systems, this line of thinking shows that future advances in PID might make the computation of emergence indices more scalable, avoiding the limitations of Eq (10) .…”
Section: Measuring Emergencementioning
confidence: 99%
“…They showed that such a random variable Z exists if and only if the columns of P S|X are linearly dependent. Inspired by this notion of weakly independent, the authors in [17], [24] carefully studied and analyzed perfect obfuscation problem where the goal is to release the useful information X while keeping S as private. Here we extend both, and establish the notion of weakly dependence based on KL-divergence and χ 2 -divergence.…”
Section: Local Information Geometry Analysismentioning
confidence: 99%
“…The framework of relaxed notions of privacy (including latent-variable privacy) has been explored in various other problems. For instance, within the context of privacy preserving data release, several works [13], [14] have proposed new privacy definitions and mechanisms with bounded leakage for latent (secret) attributes. The problem of latent-variable private information retrieval (PIR) was recently introduced in [15], where the goal is to retrieve content while satisfying perfect privacy for latent attributes.…”
Section: Introductionmentioning
confidence: 99%