NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
From MaRDI portal
Publication:6138098
DOI10.1007/978-3-031-30545-0_16zbMath1530.94039OpenAlexW4365936260MaRDI QIDQ6138098
Elaine Shi, Andrew William Park, Wei-Kai Lin
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_16
Cites Work
- Perfectly secure oblivious parallel RAM
- Black-box parallel garbled RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Yes, there is an oblivious RAM lower bound!
- Stacked garbling for disjunctive zero-knowledge proofs
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Stacked garbling. Garbled circuit proportional to longest execution path
- Gradual GRAM and secure computation for RAM programs
- OptORAMa: optimal oblivious RAM
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- \textsc{EpiGRAM}: practical garbled RAM
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- Optimizing ORAM and Using It Efficiently for Secure Computation
- On the Security of the “Free-XOR” Technique
- Garbled RAM From One-Way Functions
- Two Halves Make a Whole
- Perfectly Secure Oblivious RAM without Random Oracles
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Improved Garbled Circuit: Free XOR Gates and Applications
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Garbling XOR Gates “For Free” in the Standard Model
- How to Garble RAM Programs?
- Garbled RAM Revisited
- A Permutation Network
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
This page was built for publication: NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
