Distributed Oblivious RAM for Secure Two-Party Computation
From MaRDI portal
Recommendations
- Sub-logarithmic distributed oblivious RAM with small block size
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Multi-client oblivious RAM with poly-logarithmic communication
- Efficient maliciously secure multiparty computation for RAM
- Secure multiparty RAM computation in constant rounds
- scientific article; zbMATH DE number 1583780
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- Perfectly secure oblivious parallel RAM
Cited in
(41)- SQL on structurally-encrypted databases
- Parameter-hiding order revealing encryption
- Simple and efficient two-server ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Two-server distributed ORAM with sublinear computation and constant rounds
- OptORAMa: optimal oblivious RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- The oblivious machine. Or: how to put the C into MPC
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Oblivious RAM with worst-case logarithmic overhead
- Oblivious parallel RAM and applications
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- How to efficiently evaluate RAM programs with malicious security
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- CNF-FSS and its applications
- Asymptotically tight bounds for composing ORAM with PIR
- Sublinear zero-knowledge arguments for RAM programs
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- 3-party distributed ORAM from oblivious set membership
- Lower bound framework for differentially private and oblivious data structures
- Linear-time 2-party secure merge from additively homomorphic encryption
- Random-index oblivious RAM
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Multi-client Oblivious RAM Secure Against Malicious Servers
- OptORAMa: Optimal oblivious RAM
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- 3-party secure computation for RAMs: optimal and concretely efficient
- Memory checking for parallel RAMs
- Privacy-preserving Dijkstra
- Multiparty distributed point functions
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
- Differentially oblivious Turing machines
- Multi-server doubly efficient PIR in the classical model and beyond
- MetaDORAM: info-theoretic distributed ORAM with less communication
- Linear-time secure merge in O( n) rounds
This page was built for publication: Distributed Oblivious RAM for Secure Two-Party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910289)
