Oblivious RAM with O((logN)3) Worst-Case Cost

DOI10.1007/978-3-642-25385-0_11zbMath1227.68025OpenAlexW1545698365MaRDI QIDQ3102186

Mingfei Li, Elaine Shi, T.-H. Hubert Chan, Emil Stefanov

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_11

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (39)

Perfectly secure oblivious parallel RAM ⋮ SQL on structurally-encrypted databases ⋮ Parameter-hiding order revealing encryption ⋮ 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 ⋮ Unnamed Item ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ 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 ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ 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 ⋮ Locality-preserving oblivious RAM ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Structured encryption and dynamic leakage suppression ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ OptORAMa: optimal oblivious RAM

This page was built for publication: Oblivious RAM with O((logN)3) Worst-Case Cost