Separating computational and statistical differential privacy in the client-server model

DOI10.1007/978-3-662-53641-4_23MaRDI QIDQ3179372zbMATH OpenOpenAlexFDO

Authors Mark Bun, Yi-Hsiu Chen, Salil Vadhan

Publication date 21 December 2016

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL http://nrs.harvard.edu/urn-3:HUL.InstRepos:28235738

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Limits of computational differential privacy in the client/server setting
• Computational Differential Privacy
• Hardness of non-interactive differential privacy from one-way functions
• Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
• The algorithmic foundations of differential privacy

Cites work

• scientific article; zbMATH DE number 1670843 (Why is no real title available?)
• scientific article; zbMATH DE number 1256680 (Why is no real title available?)
• scientific article; zbMATH DE number 2086700 (Why is no real title available?)
• Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Black-box separations for differentially private protocols
• Computational Differential Privacy
• Differential privacy and robust statistics
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Do distributed differentially-private protocols require oblivious transfer?
• Foundations of Cryptography
• Limits of computational differential privacy in the client/server setting
• Limits on the Usefulness of Random Oracles
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• New techniques for noninteractive zero-knowledge
• On the complexity of differentially private data release, efficient algorithms and hardness results
• Order-revealing encryption and the hardness of private learning
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Pcps and the hardness of generating private synthetic data
• Privacy-Preserving Stream Aggregation with Fault Tolerance
• Resettable zero-knowledge (extended abstract)
• The complexity of computing the optimal composition of differential privacy
• Theory of Cryptography
• What can we learn privately?
• ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
• Zaps and Their Applications

Cited in

(5)

• Limits of computational differential privacy in the client/server setting
• The complexity of differential privacy
• Hardness of non-interactive differential privacy from one-way functions
• Computationally differentially private inner-product protocols imply oblivious transfer
• Computational Differential Privacy

This page was built for publication: Separating computational and statistical differential privacy in the client-server model

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