scientific article; zbMATH DE number 7053267

zbMath1421.68040MaRDI QIDQ5743386

Olga Ohrimenko, Roberto Tamassia, Michael T. Goodrich, Michael Mitzenmacher

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095130

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data encryption (aspects in computer science) (68P25)

Related Items (18)

Perfectly secure oblivious parallel RAM ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ The complexity of secure RAMs ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ 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? ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Unnamed Item ⋮ OptORAMa: optimal oblivious RAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved sorting networks with O(log N) depth
• Sorting networks of logarithmic depth, further simplified
• Sorting in \(c \log n\) parallel steps
• Oblivious RAMs without cryptogrpahic assumptions
• 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
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• Oblivious RAM Revisited
• Some Open Questions Related to Cuckoo Hashing
• Relations Among Complexity Measures
• Software protection and simulation on oblivious RAMs
• Hypercubic Sorting Networks
• Cuckoo hashing
• Probability and Computing
• More Robust Hashing: Cuckoo Hashing with a Stash

This page was built for publication: