An Improved Private Mechanism for Small Databases
From MaRDI portal
Publication:3448856
DOI10.1007/978-3-662-47672-7_82zbMath1440.68069arXiv1505.00244OpenAlexW1491006636MaRDI QIDQ3448856
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.00244
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly optimal minimax estimator for high-dimensional sparse linear regression
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- The ellipsoid method and its consequences in combinatorial optimization
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Privately Releasing Conjunctions and the Statistical Query Barrier
- Differential privacy under continual observation
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Iterative Constructions and Private Data Release
- Randomized Rounding for the Largest Simplex Problem
- Private and Continual Release of Statistics
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Fingerprinting Codes and the Price of Approximate Differential Privacy
- Using Convex Relaxations for Efficiently and Privately Releasing Marginals
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Approximating Hereditary Discrepancy via Small Width Ellipsoids
- Optimal private halfspace counting via discrepancy
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: An Improved Private Mechanism for Small Databases
