Private database queries using somewhat homomorphic encryption

DOI10.1007/978-3-642-38980-1_7MaRDI QIDQ2873641zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cryptography (94A60) Database theory (68P15)

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

(14)

• SecGDB: graph encryption for exact shortest distance queries with efficient updates
• Robust high capability QKD-based database private query
• Multiuser private queries over encrypted databases
• Private database access with HE-over-ORAM architecture
• Polynomial representation is tricky: maliciously secure private set intersection revisited
• Efficient query protocol for database's privacy
• Private conjunctive query over encrypted data
• On the deductive security of queries to databases with multi-bit records
• Private information retrieval with preprocessing based on the approximate GCD problem
• A geometric approach to homomorphic secret sharing
• On the deductive security of queries to confidential databases in cloud computing systems
• Compressing unit-vector correlations via sparse pseudorandom generators
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Applied homomorphic cryptography: examples

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)