UPDF AI

Private Database Queries Using Somewhat Homomorphic Encryption

D. Boneh,Craig Gentry,2 Authors,David J. Wu

2013 · DOI: 10.1007/978-3-642-38980-1_7
International Conference on Applied Cryptography and Network Security · 202 Citations

TLDR

This work shows that using a polynomial encoding of the database enables efficient implementations of conjunction queries using somewhat homomorphic encryption, and presents two implementations of the protocol using Paillier's additively homomorphic system as well as Brakerski's somewhathomomorphic cryptosystem.