Differentially oblivious Turing machines
From MaRDI portal
Cites work
- Can we overcome the n n barrier for oblivious sorting?
- Computational Complexity
- Differential privacy under continual observation
- Distributed Oblivious RAM for Secure Two-Party Computation
- Foundations of differentially oblivious algorithms
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 7650132 (Why is no real title available?)
- Is there an oblivious RAM lower bound?
- Lower bounds for differentially private RAMs
- Lower bounds for oblivious data structures
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious parallel tight compaction
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- On the Computational Complexity of Algorithms
- One-tape, off-line Turing machine computations
- OptORAMa: optimal oblivious RAM
- PanORAMa: oblivious RAM with logarithmic overhead
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Private and continual release of statistics
- Private database access with HE-over-ORAM architecture
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- The algorithmic foundations of differential privacy
- Theory of Cryptography
- Two-Tape Simulation of Multitape Turing Machines
- Yes, there is an oblivious RAM lower bound!
This page was built for publication: Differentially oblivious Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229357)
