Fingerprinting codes and the price of approximate differential privacy
From MaRDI portal
Publication:5259533
DOI10.1145/2591796.2591877zbMath1315.94113OpenAlexW2021426916MaRDI QIDQ5259533
Mark Bun, Salil P. Vadhan, Jonathan R. Ullman
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:32186909
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items (13)
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Unnamed Item ⋮ Comment ⋮ On differential privacy and adaptive data analysis with bounded space ⋮ Learning privately with labeled and unlabeled examples ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy ⋮ Algorithmic Stability for Adaptive Data Analysis ⋮ The Complexity of Differential Privacy ⋮ Efficient algorithms for privately releasing marginals via convex relaxations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Fingerprinting codes and the price of approximate differential privacy
