\textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
From MaRDI portal
Publication:2829960
DOI10.1007/978-3-662-53015-3_20zbMATH Open1406.94056OpenAlexW2481158741MaRDI QIDQ2829960FDOQ2829960
Authors: Sanjam Garg, Payman Mohassel, Charalampos Papamanthou 
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_20
Recommendations
Cites Work
- Introduction to algorithms
- A proof of security of Yao's protocol for two-party computation
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Software protection and simulation on oblivious RAMs
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Predicate Privacy in Encryption Systems
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Structured encryption and controlled disclosure
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Garbled RAM from one-way functions
- How to efficiently evaluate RAM programs with malicious security
- How to garble RAM programs?
- Garbled RAM revisited
- Distributed Oblivious RAM for Secure Two-Party Computation
- Onion ORAM: a constant bandwidth blowup oblivious RAM
Cited In (13)
- Weighted oblivious RAM, with applications to searchable symmetric encryption
- Improved structured encryption for SQL databases via hybrid indexing
- Near-optimal private information retrieval with preprocessing
- Efficient keyword search on encrypted dynamic cloud data
- Exipnos: an efficient verifiable dynamic symmetric searchable encryption scheme with forward and backward privacy
- SQL on structurally-encrypted databases
- Simple and efficient two-server ORAM
- Asymptotically tight bounds for composing ORAM with PIR
- Forward-secure searchable encryption on labeled bipartite graphs
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Structured encryption and dynamic leakage suppression
- Backward private dynamic searchable encryption with update pattern
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
This page was built for publication: \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829960)
