Feb. 13, 2024, 5:10 a.m. | Prathamesh Dharangutte Jie Gao Ruobin Gong Guanyang Wang

cs.CR updates on arXiv.org arxiv.org

This work proposes a class of locally differentially private mechanisms for linear queries, in particular range queries, that leverages correlated input perturbation to simultaneously achieve unbiasedness, consistency, statistical transparency, and control over utility requirements in terms of accuracy targets expressed either in certain query margins or as implied by the hierarchical database structure. The proposed Cascade Sampling algorithm instantiates the mechanism exactly and efficiently. Our bounds show that we obtain near-optimal utility while being empirically competitive against output perturbation methods.

accuracy class consistency control cs.cr cs.lg database input linear locally private query requirements stat.me terms transparency utility work

Cyber Software Engineering, Senior Advisor

@ Peraton | Annapolis Junction, MD, United States

Cybersecurity Architect, Lead (NJUS)

@ NetJets | Columbus, OH, US, 43219

Security Operations Analyst

@ Commonwealth Financial Network | Waltham, MA, United States

Penetration Tester – Senior Associate - Cybersecurity

@ JPMorgan Chase & Co. | Buenos Aires, Argentina

Manager - Endpoint Security

@ Novo Nordisk | Bengaluru, Karnataka, IN

Senior Officer, Identity Access Management Administrator, Group Information Security (Contract)

@ UOB | Singapore (City Area), SG, 048624