Asymptotically Tight Bounds for Composing ORAM with PIR

DOI10.1007/978-3-662-54365-8_5zbMath1404.94033OpenAlexW2591462376MaRDI QIDQ5738784

Benny Pinkas, Ittai Abraham, Christopher W. Fletcher, Kartik Nayak, Ling Ren

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

SQL on structurally-encrypted databases ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Two-server distributed ORAM with sublinear computation and constant rounds

Uses Software

• ObliVM

Cites Work

• Unnamed Item
• Unnamed Item
• Private Database Access with HE-over-ORAM Architecture
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Oblivious Parallel RAM and Applications
• Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
• Is There an Oblivious RAM Lower Bound?
• TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
• Oblivious RAMs without cryptogrpahic assumptions
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
• Efficient, Oblivious Data Structures for MPC
• 2-Server PIR with Sub-Polynomial Communication
• Data-Oblivious Data Structures
• Perfectly Secure Oblivious RAM without Random Oracles
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Private information retrieval
• Oblivious RAM Revisited
• Software protection and simulation on oblivious RAMs
• Distributed Oblivious RAM for Secure Two-Party Computation
• How to Garble RAM Programs?
• Verifiable Oblivious Storage
• Automata, Languages and Programming

This page was built for publication: Asymptotically Tight Bounds for Composing ORAM with PIR