Spreading the privacy blanket: differentially oblivious shuffling for differential privacy

DOI10.1007/978-3-031-09234-3_25OpenAlexW4285224283MaRDI QIDQ2096625

Mingyu Liang, Jiayu Xu, Dov Gordon, Jonathan N. Katz

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_25

zbMATH Keywords

differential privacyonion routing

Mathematics Subject Classification ID

Privacy of data (68P27)

Related Items (2)

A theory of composition for differential obliviousness ⋮ Poly onions: achieving anonymity in the presence of churn

Cites Work

• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Distributing any elliptic curve based protocol
• Distributed differential privacy via shuffling
• The privacy blanket of the shuffle model
• Optimal Lower Bound for Differentially Private Multi-party Aggregation
• Secure Multi-party Shuffling
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Communication Locality in Secure Multi-party Computation
• Foundations of Differentially Oblivious Algorithms
• Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
• A Formal Treatment of Onion Routing
• A Formalization of Anonymity and Onion Routing
• Brief announcement
• Theory of Cryptography

This page was built for publication: Spreading the privacy blanket: differentially oblivious shuffling for differential privacy