Privacy Preserving Computation in Cloud Using Noise-Free Fully Homomorphic Encryption (FHE) Schemes

  • Yongge WangEmail author
  • Qutaibah M. Malluhi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9878)


With the wide adoption of cloud computing paradigm, it is important to develop appropriate techniques to protect client data privacy in the cloud. Encryption is one of the major techniques that could be used to achieve this goal. However, data encryption at the rest alone is insufficient for secure cloud computation environments. There is also the need for efficient techniques to carry out computation over encrypted data. Fully homomorphic encryption (FHE) and garbled circuits are naturally used to process encrypted data without leaking any information about the data. However, existing FHE schemes are inefficient for processing large amount of data in cloud and garbled circuits are one time programs and cannot be reused. Based on quaternion/octonion algebra and Jordan algebra over finite rings \(\mathbb {Z}_q\), this paper designs efficient fully homomorphic symmetric key encryption (FHE) schemes without bootstrapping (that is, noise-free FHE schemes) that are secure in the weak ciphertext-only security model assuming the hardness of solving multivariate quadratic equation systems and solving univariate high degree polynomial equation systems in \(\mathbb {Z}_q\). The FHE scheme designed in this paper is sufficient for privacy preserving computation in cloud.



The first author would like to thank Martin Strand for several comments on an early version of this paper and thank Craig Gentry for pointing out the reference [7].


  1. 1.
    Baez, J.: The octonions. Bullet. Am. Math. Soc. 39(2), 145–205 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: NIST special publication 800–57. NIST Special Publication 800(57), 1–142 (2007)Google Scholar
  3. 3.
    Brakerski, Z.: When homomorphism becomes a liability. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 143–161. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Charlap, L.S., Rees, H.D., Robbins, D.P.: The asymptotic probability that a random biased matrix is invertible. Discrete Math. 82(2), 153–163 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dembowski, P.: Finite Geometries: Reprint of the 1968 Edition. Classics in Mathematics. Springer, Heidelberg (2012)Google Scholar
  6. 6.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. STOC 9, 169–178 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kipnis, A., Hibshoosh, E.: Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. IACR ePrint Archive 2012:637 (2012)Google Scholar
  8. 8.
    Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem. In: Proceeding Crypto (1999)Google Scholar
  9. 9.
    Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 83–97. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Lidl, R., Niederreiter, H.: Finite Fields, vol. 20. Cambridge University Press, Cambridge (1997)zbMATHGoogle Scholar
  11. 11.
    Pless, V.: The number of isotropic subspaces in a finite geometry. (Italian summary). Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 39, 418–421 (1965)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Sturmfels, B.: What is a Gröbner basis. Notices Amer. Math. Soc 52(10), 1199–1200 (2005)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Valiant, L.: Universal circuits. In: Proceeding 8th ACM STOC, pp. 196–203. ACM (1976)Google Scholar
  14. 14.
    Wang, Y.: PKCS: public-key cryptography standards. In: Bidgoli, H. (ed.) Handbook of Information Security, pp. 966–978. Wiley, Hoboken (2006)Google Scholar
  15. 15.
    Yao, A.: How to generate and exchange secrets. In: Proceeding 27th IEEE FOCS, pp. 162–167. IEEE (1986)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of SISUNC CharlotteCharlotteUSA
  2. 2.KINDI CenterQatar UniversityDohaQatar

Personalised recommendations