Optimizing ORAM and Using It Efficiently for Secure Computation
From MaRDI portal
Recommendations
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Three-party ORAM for secure computation
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- OptORAMa: optimal oblivious RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Efficient padding oracle attacks on cryptographic hardware
- The complexity of secure RAMs
Cited in
(33)- Perfectly secure oblivious parallel RAM
- SQL on structurally-encrypted databases
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Simple and efficient two-server ORAM
- Constant-round maliciously secure two-party computation in the RAM model
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Stronger lower bounds for online ORAM
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Private database access with HE-over-ORAM architecture
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Three-party ORAM for secure computation
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Data-oblivious graph algorithms in outsourced external memory
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- Multi-user binary tree based ORAM scheme
- Constant-round maliciously secure two-party computation in the RAM model
- Succinct oblivious RAM
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Asymptotically tight bounds for composing ORAM with PIR
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- M-ORAM Revisited: Security and Construction Updates
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Weighted oblivious RAM, with applications to searchable symmetric encryption
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Random-index oblivious RAM
- Maliciously secure multi-client ORAM
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Optimal oblivious algorithms for multi-way joins
This page was built for publication: Optimizing ORAM and Using It Efficiently for Secure Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876659)
