Optimal Lower Bound for Differentially Private Multi-party Aggregation

DOI10.1007/978-3-642-33090-2_25zbMath1365.68064OpenAlexW1604615751MaRDI QIDQ2912848

Dawn Song, Elaine Shi, T.-H. Hubert Chan

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/186488

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ Unnamed Item ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Unnamed Item ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Non-interactive anonymous router ⋮ Practical Fault-Tolerant Data Aggregation ⋮ Spreading the privacy blanket: differentially oblivious shuffling for differential privacy ⋮ The Complexity of Differential Privacy

This page was built for publication: Optimal Lower Bound for Differentially Private Multi-party Aggregation