Distributed Oblivious RAM for Secure Two-Party Computation
From MaRDI portal
Publication:4910289
DOI10.1007/978-3-642-36594-2_22zbMath1315.94088OpenAlexW2155720185MaRDI QIDQ4910289
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_22
Related Items (25)
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 ⋮ Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ CNF-FSS and Its Applications ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Random-index oblivious RAM ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Oblivious Parallel RAM and Applications ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ OptORAMa: optimal oblivious RAM
This page was built for publication: Distributed Oblivious RAM for Secure Two-Party Computation
