Hardness of non-interactive differential privacy from one-way functions

DOI10.1007/978-3-319-96884-1_15MaRDI QIDQ1673404zbMATH OpenOpenAlexFDO

Authors L. Kowalczyk, Tal Malkin, Daniel Wichs, Jonathan Ullman

Publication date 12 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96884-1_15

zbMATH Keywords

differential privacy

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Strong hardness of privacy from weak traitor tracing
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Answering \(n^2+o(1)\) counting queries with differential privacy is hard
• The algorithmic foundations of differential privacy
• Separating computational and statistical differential privacy in the client-server model

Cited in

(10)

• PCPs and the hardness of generating synthetic data
• Strong hardness of privacy from weak traitor tracing
• Collusion resistant traitor tracing from learning with errors
• Comparative study of differentially private data synthesis methods
• Separating computational and statistical differential privacy in the client-server model
• Collusion-resistant functional encryption for RAMs
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Dynamic collusion bounded functional encryption from identity-based encryption
• Non-interactive secure computation from one-way functions
• New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings

This page was built for publication: Hardness of non-interactive differential privacy from one-way functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673404)