Fingerprinting Codes and the Price of Approximate Differential Privacy

DOI10.1137/15M1033587zbMath1402.68071arXiv1311.3158OpenAlexW2898996243MaRDI QIDQ4554072

Mark Bun, Jonathan R. Ullman, Salil P. Vadhan

Publication date: 7 November 2018

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.3158

zbMATH Keywords

differential privacyfingerprinting codesprivacy attacks

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

An Improved Private Mechanism for Small Databases ⋮ Differentially private range query on shortest paths ⋮ Stability is stable: connections between replicability, privacy, and adaptive generalization ⋮ Structure and Sensitivity in Differential Privacy: Comparing K-Norm Mechanisms

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Row products of random matrices
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Complexity of Computing the Optimal Composition of Differential Privacy
• 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
• Preserving Statistical Validity in Adaptive Data Analysis
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• PCPs and the Hardness of Generating Private Synthetic Data
• What Can We Learn Privately?
• 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
• Neural Network Learning
• On the complexity of differentially private data release
• Analyze gauss
• Advances in Cryptology – CRYPTO 2004
• Algorithmic stability for adaptive data analysis
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography
• Optimal probabilistic fingerprint codes

This page was built for publication: Fingerprinting Codes and the Price of Approximate Differential Privacy