Onion ORAM: a constant bandwidth blowup oblivious RAM

DOI10.1007/978-3-662-49099-0_6MaRDI QIDQ2799094zbMATH OpenOpenAlexFDO

Authors Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Sub-logarithmic distributed oblivious RAM with small block size
• Asymptotically tight bounds for composing ORAM with PIR
• Yes, there is an oblivious RAM lower bound!
• Oblivious RAM with worst-case logarithmic overhead

Cites work

• Authenticated data structures, generically
• Better bootstrapping in fully homomorphic encryption
• Better key sizes (and attacks) for LWE-based encryption
• Bootstrapping for HElib
• Checking the correctness of memories
• Efficient, oblivious data structures for MPC
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Garbled RAM revisited
• How to garble RAM programs?
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• Information Security
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Private database access with HE-over-ORAM architecture
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Security and composition of multiparty cryptographic protocols
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Software protection and simulation on oblivious RAMs
• Verifiable oblivious storage

Cited in

(26)

• 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
• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Bootstrapping for BGV and BFV revisited
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Succinct oblivious RAM
• Path ORAM
• Asymptotically tight bounds for composing ORAM with PIR
• scientific article; zbMATH DE number 7650132 (Why is no real title available?)
• Is there an oblivious RAM lower bound for online reads?
• Is there an oblivious RAM lower bound for online reads?
• Locality-preserving oblivious RAM
• 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
• \textsf{MacORAMa}: optimal oblivious RAM with integrity
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Near-optimal private information retrieval with preprocessing
• A logarithmic lower bound for oblivious RAM (for all parameters)
• Optimal oblivious algorithms for multi-way joins
• MetaDORAM: info-theoretic distributed ORAM with less communication
• Resizable oblivious RAM

Describes a project that uses

Uses Software

• HElib

This page was built for publication: Onion ORAM: a constant bandwidth blowup oblivious RAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799094)