Optimal lower bound for differentially private multi-party aggregation
From MaRDI portal
Recommendations
- Distributed Private Data Analysis
- Private aggregation from fewer anonymous messages
- Lower bounds in differential privacy
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Private multiparty sampling and approximation of vector combinations
Cited in
(17)- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Non-interactive anonymous router
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- Private aggregation from fewer anonymous messages
- 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
- A lower bound on the release of differentially private integer partitions
- Lower bounds on the error of query sets under the differentially-private matrix mechanism
- Practical fault-tolerant data aggregation
- Practical locally private heavy hitters
- The complexity of differential privacy
- Computational two-party correlation: a dichotomy for key-agreement protocols
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- Privacy-preserving parameter estimation in distributed cases
- Computationally differentially private inner-product protocols imply oblivious transfer
- Pure-DP aggregation in the shuffle model: error-optimal and communication-efficient
- On distributed differential privacy and counting distinct elements
This page was built for publication: Optimal lower bound for differentially private multi-party aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912848)
