The complexity of differential privacy
From MaRDI portal
Publication:5021135
Recommendations
Cites work
- scientific article; zbMATH DE number 6680986 (Why is no real title available?)
- scientific article; zbMATH DE number 5485439 (Why is no real title available?)
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1263236 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A learning theory approach to noninteractive database privacy
- A proof of security of Yao's protocol for two-party computation
- A theory of the learnable
- Advances in Cryptology – CRYPTO 2004
- Algorithmic stability for adaptive data analysis
- An introduction to randomness extractors
- Analyzing graphs with node differential privacy
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Computational Differential Privacy
- Computational analogues of entropy
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Differential Privacy
- Differential privacy and robust statistics
- Differential privacy under continual observation
- Differentially private data analysis of social networks via restricted sensitivity
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Do distributed differentially-private protocols require oblivious transfer?
- Efficient algorithms for privately releasing marginals via convex relaxations
- Efficient noise-tolerant learning from statistical queries
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Fingerprinting codes and the price of approximate differential privacy
- Foundations of Cryptography
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Geometric discrepancy. An illustrated guide
- Grothendieck-type inequalities in combinatorial optimization
- Limits of computational differential privacy in the client/server setting
- Limits on the usefulness of random oracles
- Local, private, efficient protocols for succinct histograms
- Lower bounds in differential privacy
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On data structures and asymmetric communication complexity
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Optimal lower bound for differentially private multi-party aggregation
- Optimal private halfspace counting via discrepancy
- Optimal probabilistic fingerprint codes
- 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
- Preserving statistical validity in adaptive data analysis (extended abstract)
- Privacy aware learning
- Privacy-preserving statistical estimation with optimal convergence rates
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Pure differential privacy for rectangle queries via private partitions
- Randomized response: a survey technique for eliminating evasive answer bias
- Separating computational and statistical differential privacy in the client-server model
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Simultaneous private learning of multiple concepts
- Six Standard Deviations Suffice
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Strong hardness of privacy from weak traitor tracing
- The Composition Theorem for Differential Privacy
- The algorithmic foundations of differential privacy
- The complexity of computing the optimal composition of differential privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- The primes contain arbitrarily long arithmetic progressions
- The primes contain arbitrarily long polynomial progressions
- Theory of Cryptography
- Tracing traitors
- Unconditional differentially private mechanisms for linear queries
- What can we learn privately?
Cited in
(16)- Formalizing data deletion in the context of the right to be forgotten
- 30 years of synthetic data
- Distribution-invariant differential privacy
- General inferential limits under differential and pufferfish privacy
- Comparative study of differentially private data synthesis methods
- Resolving the Complexity of Some Data Privacy Problems
- Differentially private learning of geometric concepts
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard
- Majority vote for distributed differentially private sign selection
- scientific article; zbMATH DE number 7415075 (Why is no real title available?)
- Opacity enforcement in discrete event systems using differential privacy
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Addressing Complexity in a Privacy Expert System
- Concurrent composition of differential privacy
- Private measures, random walks, and synthetic data
- Impossibility of Differentially Private Universally Optimal Mechanisms
This page was built for publication: The complexity of differential privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021135)
