Multi-Analyst Differential Privacy for Online Query Answering

نویسندگان

چکیده

Most differentially private mechanisms are designed for the use of a single analyst. In reality, however, there often multiple stakeholders with different and possibly conflicting priorities that must share same privacy loss budget. This motivates problem equitable budget-sharing multi-analyst differential privacy. Our previous work defined desiderata any mechanism in this space should satisfy introduced methods offline case where queries known advance. We extend our on query answering to online answering, come one at time be answered without knowledge following queries. demonstrate unknown ordering results fundamental limit number can while satisfying desiderata. response, we develop two mechanisms, which satisfies all cases but is subject limitations, another randomizes input order ensuring existing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Batch Query Answering Under Differential Privacy

Differential privacy is a rigorous privacy condition achieved by randomizing query answers. This paper develops efficient algorithms for answering multiple queries under differential privacy with low error. We pursue this goal by advancing a recent approach called the matrix mechanism, which generalizes standard differentially private mechanisms. This new mechanism works by first answering a di...

متن کامل

An Adaptive Mechanism for Accurate Query Answering under Differential Privacy

We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a different set of “strategy” queries to answer privately, using those answers to derive answers to the workload. The main algorithm proposed in this paper approximates the optimal strategy for any workload of linear counting q...

متن کامل

Online Query Answering with Differential Privacy: a Greedy Approach using Bayesian Inference

Data privacy issues frequently and increasingly arise for data sharing and data analysis tasks. In this paper, we study the problem of online query answering under the rigorous differential privacy model. The existing interactive mechanisms for differential privacy can only support a limited number of queries before the accumulated cost of privacy reaches a certain bound. This limitation has gr...

متن کامل

On Linear Refinement of Differential Privacy-Preserving Query Answering

Recent work showed the necessity of incorporating a user’s background knowledge to improve the accuracy of estimates from noisy responses of histogram queries. Various types of constraints (e.g., linear constraints, ordering constraints, and range constraints) may hold on the true (non-randomized) answers of histogram queries. So the idea was to apply the constraints over the noisy responses an...

متن کامل

A Data- and Workload-Aware Query Answering Algorithm for Range Queries Under Differential Privacy

We describe a new algorithm for answering a given set of range queries under -differential privacy which often achieves substantially lower error than competing methods. Our algorithm satisfies differential privacy by adding noise that is adapted to the input data and to the given query set. We first privately learn a partitioning of the domain into buckets that suit the input data well. Then w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the VLDB Endowment

سال: 2022

ISSN: ['2150-8097']

DOI: https://doi.org/10.14778/3574245.3574265