Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
From MaRDI portal
Publication:2799094
DOI10.1007/978-3-662-49099-0_6zbMath1377.94047OpenAlexW2294070790MaRDI QIDQ2799094
Christopher W. Fletcher, Marten van Dijk, Srinivas Devadas, Elaine Shi, Ling Ren, Daniel Wichs
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_6
Related Items
Large message homomorphic secret sharing from DCR and applications, A logarithmic lower bound for oblivious RAM (for all Parameters), Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time, Unnamed Item, The complexity of secure RAMs, Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts, 3-party distributed ORAM from oblivious set membership, Lower bound framework for differentially private and oblivious data structures, Random-index oblivious RAM, Unnamed Item, \textsf{MacORAMa}: optimal oblivious RAM with integrity, Bootstrapping for BGV and BFV revisited, Asymptotically Tight Bounds for Composing ORAM with PIR, Is there an oblivious RAM lower bound for online reads?, Is there an oblivious RAM lower bound for online reads?, Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM, Locality-preserving oblivious RAM, TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
Uses Software
Cites Work
- Unnamed Item
- Checking the correctness of memories
- Security and composition of multiparty cryptographic protocols
- Private Database Access with HE-over-ORAM Architecture
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Better Bootstrapping in Fully Homomorphic Encryption
- Efficient, Oblivious Data Structures for MPC
- Bootstrapping for HElib
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Evaluating Branching Programs on Encrypted Data
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Software protection and simulation on oblivious RAMs
- How to Garble RAM Programs?
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Verifiable Oblivious Storage
- Authenticated data structures, generically
- Garbled RAM Revisited
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Information Security
