Oblivious RAMs without cryptogrpahic assumptions
From MaRDI portal
Publication:2875144
DOI10.1145/1806689.1806716zbMath1293.68120OpenAlexW2073236787MaRDI QIDQ2875144
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Perfectly secure oblivious parallel RAM ⋮ Parameter-hiding order revealing encryption ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Stronger lower bounds for online ORAM ⋮ Cryptography from one-way communication: on completeness of finite channels ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Oblivious Parallel RAM and Applications ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Oblivious RAMs without cryptogrpahic assumptions
