Fully Homomorphic Encryption Scheme Based on Public Key Compression and Batch Processing
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.
KeywordsFully 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.
- 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
- 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
- 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.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
- 15.Coron, J.S., Naccached, D., Tibouchi, M.: Optimization of fully homomorphic encryption. IACR Cryptology ePrint Archive, pp. 440–458 (2011)Google Scholar
- 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). https://doi.org/10.1007/978-3-642-29011-4_27 CrossRefGoogle Scholar
- 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). https://doi.org/10.1007/978-3-642-38348-9_20 CrossRefGoogle Scholar