Oblivious RAM with O(( N)^3) worst-case cost
From MaRDI portal
Publication:3102186
Recommendations
Cited in
(52)- Perfectly secure oblivious parallel RAM
- 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
- Constant-round maliciously secure two-party computation in the RAM model
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Structured encryption and dynamic leakage suppression
- OptORAMa: optimal oblivious RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Oblivious RAM with worst-case logarithmic overhead
- 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
- Privacy-preserving k-nearest neighbour query on outsourced database
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Constant-round maliciously secure two-party computation in the RAM model
- Succinct oblivious RAM
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- 3D Visibility Representations of 1-planar Graphs
- Dynamic proofs of retrievability via oblivious RAM
- Verifiable oblivious storage
- Asymptotically tight bounds for composing ORAM with PIR
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- Locality-preserving oblivious RAM
- A theory of composition for differential obliviousness
- M-ORAM Revisited: Security and Construction Updates
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- 3-party distributed ORAM from oblivious set membership
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Multi-user image retrieval with suppression of search pattern leakage
- Maliciously secure multi-client ORAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- OptORAMa: Optimal oblivious RAM
- Memory checking for parallel RAMs
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Advanced composition theorems for differential obliviousness
- OCash: fully anonymous payments between blockchain light clients
- 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
- Resizable oblivious RAM
This page was built for publication: Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102186)
