OptORAMa: optimal oblivious RAM

DOI10.1007/978-3-030-45724-2_14OpenAlexW2898997176MaRDI QIDQ2119019

Kartik Nayak, Gilad Asharov, Elaine Shi, Wei-Kai Lin, Enoch Peserico, Ilan Komargodski

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_14

zbMATH Keywords

randomized algorithmsoblivious RAMtight compaction

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68Nxx)

Related Items (23)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ Stronger lower bounds for online ORAM ⋮ PrORAM ⋮ The complexity of secure RAMs ⋮ Klee's measure problem made oblivious ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Weighted oblivious RAM, with applications to searchable symmetric encryption ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Random-index oblivious RAM ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Locality-preserving oblivious RAM ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model

Uses Software

• ObliVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved nonconservative sequential and parallel integer sorting
• Sorting in \(c \log n\) parallel steps
• Graph-theoretic properties in computational complexity
• On probabilistic networks for selection, merging, and sorting
• Perfectly secure oblivious parallel RAM
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Yes, there is an oblivious RAM lower bound!
• Self-routing superconcentrators
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Private Database Access with HE-over-ORAM Architecture
• Is There an Oblivious RAM Lower Bound?
• Data-Oblivious Data Structures
• Perfectly Secure Oblivious RAM without Random Oracles
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Superconcentrators
• Software protection and simulation on oblivious RAMs
• On-Line Algorithms for Path Selection in a Nonblocking Network
• Distributed Oblivious RAM for Secure Two-Party Computation
• Internal DLA: Efficient Simulation of a Physical Growth Model
• Lower bounds for external memory integer sorting via network coding
• Can We Overcome the n log n Barrier for Oblivious Sorting?
• Zig-zag sort

This page was built for publication: OptORAMa: optimal oblivious RAM