Advanced composition theorems for differential obliviousness
From MaRDI portal
Cites work
- A statistical framework for differential privacy
- A theory of composition for differential obliviousness
- Amplification by shuffling: from local to central differential privacy via anonymity
- Boosting and differential privacy
- Concentrated differential privacy: simplifications, extensions, and lower bounds
- Concurrent Composition Theorems for Differential Privacy
- Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms
- Distributed differential privacy via shuffling
- Foundations of differentially oblivious algorithms
- Garbled RAM revisited
- Gaussian Differential Privacy
- scientific article; zbMATH DE number 7650132 (Why is no real title available?)
- LightDP: towards automating differential privacy proofs
- Lower bound framework for differentially private and oblivious data structures
- Lower bounds for differentially private RAMs
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Path ORAM
- Software protection and simulation on oblivious RAMs
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- Stronger privacy amplification by shuffling for Renyi and approximate differential privacy
- The algorithmic foundations of differential privacy
- The complexity of computing the optimal composition of differential privacy
- The complexity of differential privacy
- The privacy blanket of the shuffle model
- Theory of Cryptography
This page was built for publication: Advanced composition theorems for differential obliviousness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906323)
