Private database queries using somewhat homomorphic encryption
From MaRDI portal
Publication:2873641
DOI10.1007/978-3-642-38980-1_7zbMATH Open1330.94037OpenAlexW36213310MaRDI QIDQ2873641FDOQ2873641
Authors: Dan Boneh, Craig Gentry, Shai Halevi, Frank Zhigang Wang, David J. Wu 
Publication date: 24 January 2014
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38980-1_7
Recommendations
- Private database access with HE-over-ORAM architecture
- Private conjunctive query over encrypted data
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Towards practical private information retrieval from homomorphic encryption
- SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval
Cited In (12)
- Robust high capability QKD-based database private query
- Multiuser private queries over encrypted databases
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- On the deductive security of queries to databases with multi-bit records
- A geometric approach to homomorphic secret sharing
- On the deductive security of queries to confidential databases in cloud computing systems
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates
- Compressing unit-vector correlations via sparse pseudorandom generators
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem
- Applied homomorphic cryptography: examples
- Private Conjunctive Query over Encrypted Data
This page was built for publication: Private database queries using somewhat homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873641)
