Document Type
Article
Language
eng
Publication Date
10-19-2017
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Source Publication
2017 International Symposium on Networks, Computers and Communications (ISNCC)
Source ISSN
9781509042609
Abstract
Users of large commercial databases increasingly want to outsource their database operations to a cloud service providers, but guaranteeing the privacy of data in an outsourced database has become the major obstacle to this move. Encrypting all data solves the privacy issue, but makes many operations on the data impossible in the cloud, unless the service provider has the capacity to decrypt data temporarily. Homomorphic encryption would solve this issue, but despite great and on-going progress, it is still far from being operationally feasible. In 2015, we presented what we now call dodrant-homomorphic encryption, a method that encrypts numeric values deterministically using the additively homomorphic Paillier encryption and uses table lookup in order to implement multiplications. We discuss here the security implications of determinism and discuss options to avoid these pitfalls.
Recommended Citation
Schwarz, Thomas, "Dodrant-Homomorphic Encryption for Cloud Databases using Table Lookup" (2017). Mathematics, Statistics and Computer Science Faculty Research and Publications. 620.
https://epublications.marquette.edu/mscs_fac/620
Comments
Accepted version. 2017 International Symposium on Networks, Computers and Communications (ISNCC) (May 16-18, 2017). DOI. © 2017 IEEE. Used with permission.