A theory of composition for differential obliviousness

DOI10.1007/978-3-031-30620-4_1MaRDI QIDQ6085261zbMATH OpenFDO

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

Publication date 12 December 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-30620-4_1

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Foundations of differentially oblivious algorithms
• Foundations of Differentially Oblivious Algorithms
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Concurrent composition of differential privacy
• The complexity of computing the optimal composition of differential privacy

Cites work

• A Formal Treatment of Onion Routing
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• Amplification by shuffling: from local to central differential privacy via anonymity
• Beyond the Worst-Case Analysis of Algorithms
• Cache-oblivious and data-oblivious sorting and applications
• Can we overcome the n n barrier for oblivious sorting?
• Computational Differential Privacy
• Differential privacy under continual observation
• Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms
• Distinct representatives of subsets
• Distributed differential privacy via shuffling
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Foundations of differentially oblivious algorithms
• scientific article; zbMATH DE number 1504554 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 7650132 (Why is no real title available?)
• Lower bounds for external memory integer sorting via network coding
• Lower Bounds for Multiplication via Network Coding
• Lower bounds for oblivious data structures
• Non-interactive anonymous router
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
• Practical and provably secure onion routing
• Private and continual release of statistics
• Protecting data privacy in private information retrieval schemes
• Software protection and simulation on oblivious RAMs
• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• The algorithmic foundations of differential privacy
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The Max-Flow Min-Cut theorem for countable networks
• The privacy blanket of the shuffle model
• Theory of Cryptography
• Untagging Tor: a formal treatment of onion encryption

Cited in

(2)

• Foundations of Differentially Oblivious Algorithms
• Advanced composition theorems for differential obliviousness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085261)