Differential Privacy on Finite Computers
From MaRDI portal
Publication:4993311
DOI10.4230/LIPIcs.ITCS.2018.43zbMath1462.68033arXiv1709.05396OpenAlexW2963362503MaRDI QIDQ4993311
Victor Balcer, Salil P. Vadhan
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1709.05396
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preserving differential privacy under finite-precision semantics
- Fast multiplication of polynomials over fields of characteristic 2
- Bounds on the sample complexity for private learning and private data release
- Efficient algorithms for privately releasing marginals via convex relaxations
- Simultaneous Private Learning of Multiple Concepts
- Faster Algorithms for Privately Releasing Marginals
- Modern Computer Algebra
- On the geometry of differential privacy
- Iterative Constructions and Private Data Release
- Faster private release of marginals on small databases
- PCPs and the Hardness of Generating Private Synthetic Data
- What Can We Learn Privately?
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Universally Utility-maximizing Privacy Mechanisms
- A learning theory approach to noninteractive database privacy
- Theory of Cryptography
This page was built for publication: Differential Privacy on Finite Computers