Oblivious RAMs without cryptogarphic assumptions

DOI10.1145/1806689.1806716MaRDI QIDQ2875144zbMATH OpenOpenAlexFDO

Authors Miklós Ajtai

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1806689.1806716

zbMATH Keywords

obliviousRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Software protection and simulation on oblivious RAMs
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• Perfectly secure oblivious RAM without random oracles
• Oblivious RAM Revisited
• Is there an oblivious RAM lower bound?

Cited in

(16)

• Perfectly secure oblivious parallel RAM
• Parameter-hiding order revealing encryption
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Stronger lower bounds for online ORAM
• Cryptography from one-way communication: on completeness of finite channels
• Oblivious parallel RAM and applications
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Perfectly secure oblivious RAM without random oracles
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Software protection and simulation on oblivious RAMs
• 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
• Maliciously secure multi-client ORAM
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds

This page was built for publication: Oblivious RAMs without cryptogarphic assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875144)