Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
From MaRDI portal
Publication:2799096
DOI10.1007/978-3-662-49099-0_8zbMath1377.94043MaRDI QIDQ2799096
Huijia Lin, Binyi Chen, Stefano Tessaro
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_8
94A60: Cryptography
Related Items
Asymptotically Tight Bounds for Composing ORAM with PIR, Lower bound framework for differentially private and oblivious data structures, Limits of breach-resistant and snapshot-oblivious RAMs, Perfectly secure oblivious parallel RAM, Multi-client oblivious RAM with poly-logarithmic communication, Oblivious Parallel RAM and Applications, Delegating RAM Computations with Adaptive Soundness and Privacy
Cites Work
- Unnamed Item
- Oblivious Parallel RAM and Applications
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Basics of Applied Stochastic Processes
- Oblivious RAM Revisited
- Software protection and simulation on oblivious RAMs
- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability