Cache-Aided Private Variable-Length Coding with Zero and Non-Zero Leakage

Zamani, Amirreza; Oechtering, Tobias J.; Gündüz, Deniz; Skoglund, Mikael

doi:10.23919/wiopt58741.2023.10349822

2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) 2023

DOI: 10.23919/wiopt58741.2023.10349822

|View full text |Cite

Cache-Aided Private Variable-Length Coding with Zero and Non-Zero Leakage

Amirreza Zamani,

Tobias J. Oechtering,

Deniz Gündüz

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data

Zamani,

Oechtering,

Skoglund

2024

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

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.

show abstract

On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data

Zamani,

Oechtering,

Skoglund

2024

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Cache-Aided Private Variable-Length Coding with Zero and Non-Zero Leakage

Cited by 1 publication

References 31 publications

On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data

On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data

Contact Info

Product

Resources

About