\textsf{MacORAMa}: optimal oblivious RAM with integrity
From MaRDI portal
Publication:6190099
Recommendations
Cites work
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Asymptotically tight bounds for composing ORAM with PIR
- Checking the correctness of memories
- Compact proofs of retrievability
- Cuckoo hashing
- Distributed Oblivious RAM for Secure Two-Party Computation
- How Efficient Can Memory Checking Be?
- Maliciously secure multi-client ORAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Multi-client oblivious RAM with poly-logarithmic communication
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAM with worst-case logarithmic overhead
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- On the depth of oblivious parallel RAM
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- OptORAMa: optimal oblivious RAM
- Parallelizable Authentication Trees
- Path ORAM
- Perfectly secure oblivious RAM without random oracles
- Perfectly secure oblivious parallel RAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Private database access with HE-over-ORAM architecture
- Software protection and simulation on oblivious RAMs
- Sorting in \(c \log n\) parallel steps
- The complexity of online memory checking
- Verifiable oblivious storage
- Yes, there is an oblivious RAM lower bound!
This page was built for publication: \textsf{MacORAMa}: optimal oblivious RAM with integrity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190099)
