Achieving Differential Privacy in Secure Multiparty Data Aggregation Protocols on Star Networks
By Vincent Bindschaedler, Shantanu D. Rane, Alejandro E. Brito, Vanishree Rao, Ersin Uzun. 2017
28 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Quanquan Gu
- Edo Roth
- Philip S. Yu
- Julie Ann McCann
- David E. Evans
- Andreas Haeberlen
- Chia-Mu Yu
- Lingxiao Wang
In Computational Theory and Mathematics
- Edo Roth
- Philip S. Yu
- David E. Evans
- Andreas Haeberlen
- Lingxiao Wang
- Bargav Jayaraman
- Brett Hemenway Falk
- Daniel Noble
Citations in the corpus
- Honeycrisp: large-scale differentially private aggregation without a trusted core (2019, background): “However, [12] requires each user to perform O(n) public-key encryptions and requires O(n) communication between each user and the aggregator, and thus is not suitable in our setting, where n is very large, possibly up to a billion.”
- Distributed Learning without Distress: Privacy-Preserving Empirical Risk Minimization (2018, background): “Recent works on distributed noise generation [17, 3, 24, 45] try to achieve a similar bound by requiring parties to add partial noise locally, and combining these noises to ensure differential privacy.”
- $\textsf{LoPub}$ : High-Dimensional Crowdsourced Data Publication With Local Differential Privacy (2016, methodology): “[8] use noise partitioning technique to mimic the situation that the Laplace-distributed noise sample applies to the aggregate data.”