Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimum Noise Mechanism for Differentially Private Queries in Discrete
  Finite Sets   In this paper, we provide an optimal additive noise mechanism for database
queries with discrete answers on a finite support. The noise provides the
minimum error rate for a given $(\epsilon,\delta)$ pair. Popular schemes apply
random additive noise with infinite support and then clamp the resulting query
response to the desired range. Clamping, unfortunately, compromises the privacy
guarantees. Using modulo addition, rather than clamping, we show that, for any
$(\epsilon,\delta)$ pair, the optimum additive noise distribution can be
obtained by solving a mixed integer linear program (MILP). Having introduced
our optimal noise design formulation, we derive closed form solutions for the
optimal noise probability mass function (PMF) and the probability of error for
two special cases. In our performance studies, we show that the proposed
optimal mechanism outperforms state of the art for a given probability of error
and for any budget $\epsilon >0$.

30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph
13
The categories of this paper are: quant-ph
2
The categories of this paper are: math
16
The categories of this paper are: stat
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph