Differential privacy on finite computers
From MaRDI portal
Abstract: We consider the problem of designing and analyzing differentially private algorithms that can be implemented on {em discrete} models of computation in {em strict} polynomial time, motivated by known attacks on floating point implementations of real-arithmetic differentially private algorithms (Mironov, CCS 2012) and the potential for timing attacks on expected polynomial-time algorithms. As a case study, we examine the basic problem of approximating the histogram of a categorical dataset over a possibly large data universe . The classic Laplace Mechanism (Dwork, McSherry, Nissim, Smith, TCC 2006 and J. Privacy & Confidentiality 2017) does not satisfy our requirements, as it is based on real arithmetic, and natural discrete analogues, such as the Geometric Mechanism (Ghosh, Roughgarden, Sundarajan, STOC 2009 and SICOMP 2012), take time at least linear in , which can be exponential in the bit length of the input. In this paper, we provide strict polynomial-time discrete algorithms for approximate histograms whose simultaneous accuracy (the maximum error over all bins) matches that of the Laplace Mechanism up to constant factors, while retaining the same (pure) differential privacy guarantee. One of our algorithms produces a sparse histogram as output. Its "per-bin accuracy" (the error on individual bins) is worse than that of the Laplace Mechanism by a factor of , but we prove a lower bound showing that this is necessary for any algorithm that produces a sparse histogram. A second algorithm avoids this lower bound, and matches the per-bin accuracy of the Laplace Mechanism, by producing a compact and efficiently computable representation of a dense histogram, it is based on an -wise independent implementation of an appropriately clamped version of the Discrete Geometric Mechanism.
Recommendations
Cites work
- A learning theory approach to noninteractive database privacy
- Bounds on the sample complexity for private learning and private data release
- Efficient algorithms for privately releasing marginals via convex relaxations
- Fast multiplication of polynomials over fields of characteristic 2
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Introduction to algorithms.
- Iterative Constructions and Private Data Release
- Modern computer algebra
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Pcps and the hardness of generating private synthetic data
- Preserving differential privacy under finite-precision semantics
- Private data release via learning thresholds
- Simultaneous private learning of multiple concepts
- Submodular functions are noise stable
- Theory of Cryptography
- Universally utility-maximizing privacy mechanisms
- What can we learn privately?
Cited in
(8)- Secure random sampling in differential privacy
- Nearly optimal private convolution
- Satisfiability modulo counting
- Practical locally private heavy hitters
- Preserving differential privacy under finite-precision semantics
- Preserving differential privacy under finite-precision semantics
- Foundations of Differentially Oblivious Algorithms
- An accurate, scalable and verifiable protocol for federated differentially private averaging
This page was built for publication: Differential privacy on finite computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993311)
