Exponential Separations in Local Differential Privacy

DOI10.1137/1.9781611975994.31MaRDI QIDQ5146797zbMATH OpenOpenAlexFDO

Authors Matthew Joseph, Jieming Mao, Aaron Roth

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.00813

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Exponential Separations in Local Privacy
• Sample complexity bounds on differentially private learning via communication complexity
• New Lower Bounds for Privacy in Communication Protocols
• Separating Local & Shuffled Differential Privacy via Histograms
• Privacy and Communication Complexity

Cited in

(5)

• scientific article; zbMATH DE number 7233838 (Why is no real title available?)
• Heavy Hitters and the Structure of Local Privacy
• Exponential Separations in Local Privacy
• Separating Local & Shuffled Differential Privacy via Histograms
• Interactive versus noninteractive locally differentially private estimation: two elbows for the quadratic functional

This page was built for publication: Exponential Separations in Local Differential Privacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146797)