A Verifiable Fully Homomorphic Encryption Scheme
With development of cloud computing, how to keep privacy and compute outsourcing data effectively at the same time is highly significant in practice. Homomorphic encryption is a common method to support ciphertext calculation, but most schemes do not provide fully homomorphic properties. Some fully homomorphic encryption schemes feature complicated design, high computational complexity and no practicability. Some cloud service providers are not trustable and return incorrect computational results due to resource saving or other malicious behaviors. Therefore, this paper proposes a verifiable fully homomorphic encryption scheme VFHES. VFHES implements fully homomorphic encryption based on the principle of the matrix computing principle and matrix blinding technology and supports to verify correctness of the computational results. Security analysis proves that VFHES is privacy-safe and verifiable. The performance analysis and experimental results show that VFHES is practicable and effective.
KeywordsCloud computing Privacy security Fully homomorphic encryption Verifiable
This work was supported in part by the Guangxi Natural Fund Project under Grant No. 2016GXNSFAA380115, Guangxi Innovation-Driven Development Project under Grant No. AA17204058-17.
- 1.Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Annual ACM Symposium on Theory of Computing, Bethesda, pp. 169–178. ACM (2009)Google Scholar
- 3.Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Foundations of Computer Science, CA, pp. 97–106. IEEE (2011)Google Scholar
- 4.Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled)fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309–325. ACM Press, New York (2012)Google Scholar
- 5.Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, Juan A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 75–92. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_5CrossRefGoogle Scholar
- 7.Jin, F., Zhu, Y., Luo, X.: Verifiable fully homomorphic encryption scheme. In: International Conference on Consumer Electronics, Communications and Networks, Yichang, pp. 743–746. IEEE (2012)Google Scholar
- 8.Zhou, J., Cao, Z., Dong, X., et al.: EVOC: more efficient verifiable outsourced computation from any one-way trapdoor function. In: IEEE International Conference on Communications, pp. 7444–7449. IEEE (2015)Google Scholar
- 9.Ahmed, E.Y., El Kettani, M.D.E.C.: A verifiable fully homomorphic encryption scheme to secure big data in cloud computing. In: International Conference on Wireless Networks and Mobile Communications, Rabat, pp. 1–5. IEEE (2017)Google Scholar
- 10.Zhao, Q., Zeng, Q., Liu, X., Xu, H.: Verifiable computation using re-randomizable garbled circuits. J. Softw. 30(2), 399–415 (2019)Google Scholar