kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-9296-4939
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-0036-9049
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2024 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 70, no 3, p. 2177-2200Article in journal (Refereed) Published
Abstract [en]

We study an information theoretic privacy mechanism design problem for two scenarios where the private data is either observable or hidden. In the hidden private data scenario, an agent observes useful data Y that is correlated with private data X , and generate disclosed data U which maximizes the revealed information about Y while satisfying a bounded privacy leakage constraint. Considering the other scenario, the agent has additional access to X . To design the privacy mechanism, we first extend the Functional Representation Lemma and Strong Functional Representation Lemma by relaxing the independence condition and thereby allowing a certain leakage. We then find lower and upper bounds on the privacy-utility trade-offs in both scenarios. In particular, for the case where no leakage is allowed and X is observable, our upper and lower bounds improve previous bounds. Considering bounded mutual information as privacy constraint and the observable private data scenario we show that if the common information and mutual information between X and Y are equal, then the attained upper bound is tight. Finally, the privacy-utility trade-off with prioritized private data is studied where part of X is more private than the remaining part.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2024. Vol. 70, no 3, p. 2177-2200
Keywords [en]
Data privacy, information-theoretic privacy, Extended Functional Representation Lemma (EFRL), Extended Strong Functional Representation Lemma (ESFRL), per-letter privacy leakage measure, prioritized private data
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-346304DOI: 10.1109/TIT.2023.3326070ISI: 001203295400009Scopus ID: 2-s2.0-85174851335OAI: oai:DiVA.org:kth-346304DiVA, id: diva2:1857327
Note

QC 20240513

Available from: 2024-05-13 Created: 2024-05-13 Last updated: 2024-05-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Zamani, AmirrezaOechtering, Tobias J.Skoglund, Mikael

Search in DiVA

By author/editor
Zamani, AmirrezaOechtering, Tobias J.Skoglund, Mikael
By organisation
Information Science and Engineering
In the same journal
IEEE Transactions on Information Theory
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 73 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf