\textsf{MacORAMa}: optimal oblivious RAM with integrity
From MaRDI portal
Publication:6190099
DOI10.1007/978-3-031-38551-3_4MaRDI QIDQ6190099
Surya Mathialagan, Neekon Vafa
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Checking the correctness of memories
- Sorting in \(c \log n\) parallel steps
- Perfectly secure oblivious parallel RAM
- Yes, there is an oblivious RAM lower bound!
- OptORAMa: optimal oblivious RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Compact proofs of retrievability
- On the depth of oblivious parallel RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Multi-client oblivious RAM with poly-logarithmic communication
- Oblivious RAM with worst-case logarithmic overhead
- Private Database Access with HE-over-ORAM Architecture
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- Perfectly Secure Oblivious RAM without Random Oracles
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- The complexity of online memory checking
- How Efficient Can Memory Checking Be?
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Cuckoo hashing
- Distributed Oblivious RAM for Secure Two-Party Computation
- Verifiable Oblivious Storage
- Parallelizable Authentication Trees
- Asymptotically Tight Bounds for Composing ORAM with PIR
This page was built for publication: \textsf{MacORAMa}: optimal oblivious RAM with integrity
