On the (in)security of hash-based oblivious RAM and a new balancing scheme
From MaRDI portal
Publication:5743385
zbMATH Open1422.68061MaRDI QIDQ5743385FDOQ5743385
Authors: Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky 
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095129
Recommendations
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Relations Among Complexity Measures
- Space/time trade-offs in hash coding with allowable errors
- More Robust Hashing: Cuckoo Hashing with a Stash
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Oblivious RAM Revisited
- Public Key Encryption That Allows PIR Queries
- Software protection and simulation on oblivious RAMs
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Title not available (Why is that?)
- Public-Key Encryption with Efficient Amortized Updates
- Oblivious RAMs without cryptogarphic assumptions
- Perfectly secure oblivious RAM without random oracles
Cited In (38)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Succinct oblivious RAM
- OptORAMa: optimal oblivious RAM
- 3-party distributed ORAM from oblivious set membership
- Lower bound framework for differentially private and oblivious data structures
- Is there an oblivious RAM lower bound for online reads?
- OptORAMa: Optimal oblivious RAM
- Locality-preserving oblivious RAM
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Constant-round maliciously secure two-party computation in the RAM model
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Random-index oblivious RAM
- Perfectly secure oblivious parallel RAM
- Parameter-hiding order revealing encryption
- SQL on structurally-encrypted databases
- Simple and efficient two-server ORAM
- Verifiable oblivious storage
- Provably-secure remote memory attestation for heap overflow protection
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Is there an oblivious RAM lower bound for online reads?
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Limits of breach-resistant and snapshot-oblivious RAMs
- Locality-preserving oblivious RAM
- Anonymous RAM
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Structured encryption and dynamic leakage suppression
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- The complexity of secure RAMs
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Oblivious RAM with worst-case logarithmic overhead
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Stronger lower bounds for online ORAM
This page was built for publication: On the (in)security of hash-based oblivious RAM and a new balancing scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743385)
