arXiv (Cornell University) · 2013 · 12 citations · 9 references
ComputingComputer ScienceComputer SystemsComputer SecurityCryptographyDatabasesCryptographic AlgorithmsData EncryptionHomomorphic EncryptionEncrypted Database QueriesEncrypted Database QueryingEncrypted Database SystemsFully Homomorphic EncryptionQuery Processing Over Encrypted DataSearch Over Encrypted Data
The database community, at least for the last decade, has been grappling with querying encrypted data, which would enable secure database as a service solutions. A recent breakthrough in the cryptographic community (in 2009) related to fully homomorphic encryption (FHE) showed that arbitrary computation on encrypted data is possible. Successful adoption of FHE for query processing is, however, still a distant dream, and numerous challenges have to be addressed. One challenge is how to perform algebraic query processing of encrypted data, where we produce encrypted intermediate results and operations on encrypted data can be composed. In this paper, we describe our solution for algebraic query processing of encrypted data, and also outline several other challenges that need to be addressed, while also describing the lessons that can be learnt from a decade of work by the database community in querying encrypted data.
9
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009 · 6.6K citations
Thomas Ristenpart, Eran Tromer, Hovav Shacham et al. · 2009 · 2K citations
Order preserving encryption for numeric data
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant et al. · 2004 · 1.2K citations
Executing SQL over encrypted data in the database-service-provider model
Hakan Hacígümüş, B. R. Iyer, Chen Li et al. · 2002 · 1.1K citations
Computing arbitrary functions of encrypted data
Craig Gentry · Communications of the ACM · 2010 · 656 citations