NanoGRAM: garbled RAM with O( N) overhead
From MaRDI portal
Publication:6138098
Recommendations
Cites work
- A Permutation Network
- Adaptive succinct garbled RAM or: how to delegate your database
- Black-box parallel garbled RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Cryptography for parallel RAM from indistinguishability obfuscation
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Fully succinct garbled RAM
- Garbled RAM from one-way functions
- Garbled RAM revisited
- Garbling XOR gates ``for free in the standard model
- Gradual GRAM and secure computation for RAM programs
- How to garble RAM programs?
- Improved Garbled Circuit: Free XOR Gates and Applications
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the security of the ``Free-XOR technique
- OptORAMa: optimal oblivious RAM
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Path ORAM
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
- Perfectly secure oblivious RAM without random oracles
- Perfectly secure oblivious parallel RAM
- Software protection and simulation on oblivious RAMs
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacked garbling. Garbled circuit proportional to longest execution path
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Yes, there is an oblivious RAM lower bound!
- \textsc{EpiGRAM}: practical garbled RAM
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
This page was built for publication: NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138098)
