Oblivious RAM Revisited

DOI10.1007/978-3-642-14623-7_27zbMath1283.94102OpenAlexW2167394920MaRDI QIDQ3582774

Tzachy Reinman, Benny Pinkas

Publication date: 24 August 2010

Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_27

zbMATH Keywords

secure two-party computationoblivious RAM

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (19)

SQL on structurally-encrypted databases ⋮ Unnamed Item ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ M-ORAM Revisited: Security and Construction Updates ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Multi-user image retrieval with suppression of search pattern leakage ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Simple and efficient two-server ORAM ⋮ Effective error-tolerant keyword search for secure cloud computing ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Oblivious Parallel RAM: Improved Efficiency and Generic Constructions ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Oblivious RAM Revisited