Distributed Private Data Analysis: Simultaneously Solving How and What
From MaRDI portal
Recommendations
Cites work
- A communication-privacy tradeoff for modular addition
- Advances in Cryptology – CRYPTO 2004
- Differential Privacy
- scientific article; zbMATH DE number 5485439 (Why is no real title available?)
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Randomized response: a survey technique for eliminating evasive answer bias
- Theory of Cryptography
- Theory of Cryptography
- What can we learn privately?
Cited in
(30)- Non-interactive anonymous router
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Confidential gossip
- Concurrent composition of differential privacy
- Selective private function evaluation with applications to private statistics
- Limits on the usefulness of random oracles
- Separating computational and statistical differential privacy in the client-server model
- Rate-limited secure function evaluation
- Distributed Private Data Analysis
- Minimax Optimal Procedures for Locally Private Estimation
- Comment
- Comment
- Rejoinder
- Rate-limited secure function evaluation: definitions and constructions
- The complexity of differential privacy
- Computational two-party correlation: a dichotomy for key-agreement protocols
- Empirical risk minimization in the non-interactive local model of differential privacy
- On differential privacy and adaptive data analysis with bounded space
- Preserving privacy between features in distributed estimation
- Willow: secure aggregation with one-shot clients
- Computationally differentially private inner-product protocols imply oblivious transfer
- Pure-DP aggregation in the shuffle model: error-optimal and communication-efficient
- Efficient privacy-preserving counting method with homomorphic encryption
- Visualizing differentially private mechanisms with physical cards
- Noninteractive locally private learning of linear models via polynomial approximations
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Near-optimal differentially private graph algorithms via the multidimensional abovethreshold mechanism
- On the privacy of sublinear-communication Jaccard index estimation via min-hash
This page was built for publication: Distributed Private Data Analysis: Simultaneously Solving How and What
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600234)