A theory of composition for differential obliviousness

DOI10.1007/978-3-031-30620-4_1zbMath1528.94089MaRDI QIDQ6085261

Mingxun Zhou, T.-H. Hubert Chan, Elaine Shi, Shir Maimon

Publication date: 12 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

\((\epsilon , \delta )\)-neighbor-preserving-DOdifferentially oblivious algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Max-Flow Min-Cut theorem for countable networks
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Protecting data privacy in private information retrieval schemes
• Untagging Tor: a formal treatment of onion encryption
• 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
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• Distributed differential privacy via shuffling
• The privacy blanket of the shuffle model
• Differential privacy under continual observation
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Computational Differential Privacy
• The Algorithmic Foundations of Differential Privacy
• Private and Continual Release of Statistics
• Software protection and simulation on oblivious RAMs
• Lower Bounds for Multiplication via Network Coding
• Beyond the Worst-Case Analysis of Algorithms
• Lower bounds for external memory integer sorting via network coding
• Can We Overcome the n log n Barrier for Oblivious Sorting?
• Lower Bounds for Oblivious Data Structures
• Foundations of Differentially Oblivious Algorithms
• Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
• A Formal Treatment of Onion Routing
• Distinct representatives of subsets
• Theory of Cryptography
• Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms

This page was built for publication: A theory of composition for differential obliviousness