9 problems

Berrett–Györfi–Walk conjecture. Without the strong density assumption, the convergence rate in the privatized case could be arbitrarily slow.

Let $n\geq 3$ shares be generated from an input, using the sparse polynomial secret-sharing construction described above. For $n=2$, the total leakage is minimized when all shares…

List-privacy upper-bound conjecture. List $\rho$-privacy equals the upper bound:

Let $Y\sim\operatorname{Unif}(\{\pm1\})$, $X=Y$, and let $\mathcal{S}_k$ be the family of functions used in the numerical experiment, with $k\ll n$. Small empirical square-loss con…

Let $Q(c)$ denote the set of reserve vectors having marginal price $c$ for a strictly convex trading function. In the Curve example, scaling the reserves by a nonzero constant chan…

Let $X=(X_1,\ldots,X_N)$ be raw data with independent components, let $Y'$ be a parallelized privatization constructed component-wise, and consider privacy leakage and utility cons…

Let $n$ be a positive integer and let $m$ be the input size. Define … where $f$ is the auction-output function. Asymptotic form conjecture for $c_n$. There exists a positive ration…

Let the privacy–utility optimization problem use either the mutual information utility metric or the Fisher information utility metric, with the corresponding parameters and constr…

A private sequential function computation scheme consists of the protocol proposed in this paper for computing a function while preserving the required privacy constraints; its cap…