Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

DOI10.1007/978-3-642-22012-8_46zbMath1333.68100arXiv1007.1259OpenAlexW1704895987MaRDI QIDQ3012949

Michael Mitzenmacher, Michael T. Goodrich

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1259

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)

Related Items (30)

SSE and SSD: page-efficient searchable symmetric encryption ⋮ 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 ⋮ Unnamed Item ⋮ Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives ⋮ Stronger lower bounds for online ORAM ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Multi-user image retrieval with suppression of search pattern leakage ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Oblivious Parallel RAM and Applications ⋮ Oblivious Parallel RAM: Improved Efficiency and Generic Constructions ⋮ Locality-preserving oblivious RAM ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ 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

Uses Software

• BSGP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblivious RAMs without cryptogrpahic assumptions
• Perfectly Secure Oblivious RAM without Random Oracles
• A precise analysis of Cuckoo hashing
• Oblivious RAM Revisited
• Software protection and simulation on oblivious RAMs
• Cuckoo hashing
• More Robust Hashing: Cuckoo Hashing with a Stash

This page was built for publication: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation