kth.sePublications KTH
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
Bounds for Privacy-Utility Trade-off with Per-letter Privacy Constraints and Non-zero Leakage
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
2022 (English)In: 2022 IEEE INFORMATION THEORY WORKSHOP (ITW), Institute of Electrical and Electronics Engineers (IEEE) , 2022, p. 13-18Conference paper, Published paper (Refereed)
Abstract [en]

An information theoretic privacy mechanism design problem for two scenarios is studied where the private data is either hidden or observable. In each scenario, privacy leakage constraints are considered using two different measures. In these scenarios the private data is hidden or observable. In the first scenario, an agent observes useful data Y that is correlated with private data X, and wishes to disclose the useful information to a user. A privacy mechanism is designed to generate disclosed data U which maximizes the revealed information about Y while satisfying a per-letter privacy constraint. In the second scenario, the agent has additionally access to the private data. First, the Functional Representation Lemma and Strong Functional Representation Lemma are extended by relaxing the independence condition to find a lower bound considering the second scenario. Next, lower bounds as well as upper bounds on privacy-utility trade-off are derived for both scenarios. In particular, for the case where X is deterministic function of Y, we show that our upper and lower bounds are asymptotically optimal considering the first scenario.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2022. p. 13-18
Series
Information Theory Workshop, ISSN 2475-420X
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-324047DOI: 10.1109/ITW54588.2022.9965856ISI: 000904341100003Scopus ID: 2-s2.0-85144594144OAI: oai:DiVA.org:kth-324047DiVA, id: diva2:1738473
Conference
IEEE Information Theory Workshop (ITW), NOV 01-09, 2022, Indian Inst Technol Bombay, Mumbai, INDIA
Note

QC 20230222

Available from: 2023-02-22 Created: 2023-02-22 Last updated: 2023-02-22Bibliographically 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
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 87 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