Homomorphic Evaluation of Database Queries

  • Hamid UsefiEmail author
  • Sudharaka Palamakumbura
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 235)


Homomorphic encryption is an encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. This paper discusses how database search queries can be made secure using a homomorphic encryption scheme. We propose a new database search technique that can be used with the ring-based fully homomorphic encryption scheme proposed by Braserski.


Homomorphic Privacy Encryption Database Query 


  1. 1.
    Gahi, Y., Guennoun, M., El-Khatib, K.: A secure database system using homomorphic encryption schemes. In: The Third International Conference on Advances in Databases, Knowledge, and Data Applications (2011)Google Scholar
  2. 2.
    van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010). Scholar
  3. 3.
    Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505–524. Springer, Heidelberg (2011). Scholar
  4. 4.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Hesse, H., Matthies, C.: Introduction to homomorphic encryption. In: Cloud Security Mechanisms, December 2013Google Scholar
  6. 6.
    Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)Google Scholar
  7. 7.
    Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 102–118. Springer, Heidelberg (2013). Scholar
  8. 8.
    Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45–64. Springer, Heidelberg (2013). Scholar
  9. 9.
    Harrison, B.: On the reducibility of cyclotomic polynomials over finite fields. Am. Math. Mon. 114, 813–818 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kim, M., Lee, H.T., Ling, S., Wang, H.: On the efficiency of FHE-based private queries. IEEE Trans. Dependable Secure Comput. 15(2), 357–363 (2018)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018

Authors and Affiliations

  1. 1.Department of Mathematics and StatisticsMemorial University of NewfoundlandSt. John’sCanada
  2. 2.Department of Mathematics and Computer ScienceAmirKabir University of TechnologyTehranIran

Personalised recommendations