Private Database Access with HE-over-ORAM Architecture

DOI10.1007/978-3-319-28166-7_9zbMath1459.68057OpenAlexW2296585978MaRDI QIDQ2794501

Shai Halevi, Mariana Raykova, Craig Gentry, Charanjit S. Jutla

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_9

zbMATH Keywords

homomorphic encryptionsecure computationPIRORAMcomparison protocolsprivate queries

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Privacy of data (68P27)

Related Items

A logarithmic lower bound for oblivious RAM (for all Parameters), Oblivious RAM with \textit{worst-case} logarithmic overhead, Constant-Round Maliciously Secure Two-Party Computation in the RAM Model, Linear-time 2-party secure merge from additively homomorphic encryption, \textsf{MacORAMa}: optimal oblivious RAM with integrity, Oblivious RAM with worst-case logarithmic overhead, Low-Leakage Secure Search for Boolean Expressions, Asymptotically Tight Bounds for Composing ORAM with PIR, Constant-round maliciously secure two-party computation in the RAM model, Is there an oblivious RAM lower bound for online reads?, Is there an oblivious RAM lower bound for online reads?, Private Database Access with HE-over-ORAM Architecture, Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM, Encryption Switching Protocols, OptORAMa: optimal oblivious RAM

Cites Work

• Unnamed Item
• Private Database Access with HE-over-ORAM Architecture
• (Leveled) fully homomorphic encryption without bootstrapping
• Practical Bootstrapping in Quasilinear Time
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Algorithms in HElib
• Optimizing ORAM and Using It Efficiently for Secure Computation
• Fully Homomorphic Encryption with Polylog Overhead
• Better Bootstrapping in Fully Homomorphic Encryption
• Multiparty Computation from Somewhat Homomorphic Encryption
• Efficient, Oblivious Data Structures for MPC
• Sub-linear, Secure Comparison with Two Non-colluding Parties
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Private information retrieval
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Secure Equality and Greater-Than Tests with Sublinear Online Complexity
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography