Fully Homomorphic Encryption Scheme Based on Public Key Compression and Batch Processing

  • Liquan Chen
  • Ming Lim
  • Muyang Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10726)


Fully homomorphic encryption is a type of encryption technique that allows arbitrary complex operations to be performed on the ciphertext, thus generating an encrypted result that, when decrypted, matches the results of those operations performed on the plaintext. The DGHV scheme over the integers is one of the key schemes in fully homomorphic encryption research field, but the incredible size of the public key and the low computational efficiency are the main challenges. Based on the original DGHV encryption structure and parameters’ design, the idea of batch processing was introduced in this paper. With the combination of the quadratic parameter-based public key compression mechanism, a complete public key compression and batch processing fully homomorphic encryption (PKCB-FHE) scheme was presented. Like those in the original DGHV scheme, the parameter restriction of the proposed scheme was presented. Further analysis and simulation of the proposed scheme indicate that the required storage space of the public key is immensely reduced and that the overall length of the public key is compressed. Furthermore, the total processing time of the proposed scheme is reduced, which makes it much more efficient than those existing schemes.


Fully homomorphic encryption Public key compression Batch technology Quadratic parameter 



This work was supported in part by the European Commission Marie Curie IRSES project “AdvIOT” and the national Natural Science Foundation of China (NSFC) under grant No.61372103.


  1. 1.
    Kaosar, M.G., Paulet, R., Yi, X.: Fully homomorphic encryption based two-party association rule mining. Data Knowl. Eng. 76, 1–15 (2012)CrossRefGoogle Scholar
  2. 2.
    Yan, H., Li, J., Han, J.: A novel efficient remote data possession checking protocol in cloud storage. IEEE Trans. Inf. Forensics Secur. 12(1), 78–88 (2017)CrossRefGoogle Scholar
  3. 3.
    Wang, W., Hu, Y., Chen, L., Huang, X.: Exploring the feasibility of fully homomorphic encryption. IEEE Trans. Comput. 64(3), 698–706 (2015)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cheon, J.H., Kim, J.: A hybrid scheme of public-key encryption and somewhat homomorphic encryption. IEEE Trans. Inf. Forensics Secur. 10(5), 1208–1212 (2015)Google Scholar
  5. 5.
    Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169–180 (1978)MathSciNetGoogle Scholar
  6. 6.
    Gentry, C.: A Fully Homomorphic Encryption Scheme. Stanford University, Stanford (2009)MATHGoogle Scholar
  7. 7.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York, vol. 9, pp. 169–178 (2009)Google Scholar
  8. 8.
    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). CrossRefGoogle Scholar
  9. 9.
    Stehlé, D., Steinfeld, R.: Faster fully homomorphic encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 377–394. Springer, Heidelberg (2010). CrossRefGoogle Scholar
  10. 10.
    Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868–886. Springer, Heidelberg (2012). CrossRefGoogle Scholar
  11. 11.
    Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (Standard) LWE. In: Proceedings of IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 97–106 (2011)Google Scholar
  12. 12.
    Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS), pp. 309–325 (2012)Google Scholar
  13. 13.
    Zhang, X., Xu, C., Jin, C.: Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme. Future Gener. Comput. Syst. 36, 180–186 (2014)CrossRefGoogle Scholar
  14. 14.
    Plantard, T., Susilo, W., Zhang, Z.: Fully homomorphic encryption using hidden ideal lattice. IEEE Trans. Inf. Forensics Secur. 8(12), 2127–2137 (2013)CrossRefGoogle Scholar
  15. 15.
    Coron, J.S., Naccached, D., Tibouchi, M.: Optimization of fully homomorphic encryption. IACR Cryptology ePrint Archive, pp. 440–458 (2011)Google Scholar
  16. 16.
    Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487–504. Springer, Heidelberg (2011). CrossRefGoogle Scholar
  17. 17.
    Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 446–464. Springer, Heidelberg (2012). CrossRefGoogle Scholar
  18. 18.
    Chen, Z., Wang, J., Zhang, Z., Song, X.: A fully homomorphic encryption scheme with better key size. China Commun. 28(4), 82–92 (2014)CrossRefGoogle Scholar
  19. 19.
    Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420–443. Springer, Heidelberg (2010). CrossRefGoogle Scholar
  20. 20.
    Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Crypt. 71(1), 57–81 (2014)CrossRefMATHGoogle Scholar
  21. 21.
    Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315–335. Springer, Heidelberg (2013). CrossRefGoogle Scholar
  22. 22.
    Beneš, V.E.: Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43(4), 1641–1656 (2013)MathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Information Science and EngineeringSoutheast UniversityNanjingChina
  2. 2.Center of Supply Chain and Operations ManagementCoventry UniversityCoventryUK

Personalised recommendations