Abstract
Homomorphic encryption supports meaningful operations on ciphertext and is widely used in outsourcing computing, secure multi-party computing and other scenarios. The TFHE-type fully homomorphic encryption scheme has an efficient bootstrapping process, so it supports efficient homomorphic logic gate circuits. However, its single-bit encryption feature results in a large ciphertext expansion (the ciphertext expansion rate of the CGGI16, CGGI17, and ZYL + 18 scheme is 16032). Therefore, how to reduce the scale of ciphertext without affecting the efficiency is a practical problem. TFHE-type fully homomorphic encryption scheme with shorter ciphertexts is constructed. By applying the round function to the encryption process, the ciphertext scale is reduced by 62%; Using the GPU's ability to implement large-scale matrix operations efficiently, a fully homomorphic encryption scheme with shorter ciphertexts is implemented based on the cuFHE. The experimental results show that, compared with the CGGI17 scheme, the running time of a single gate circuit (including the bootstrapping process) in this scheme does not exceed 1 ms on the CUDA platform, and the ciphertext scale of this algorithm is reduced by 62%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Zhou, Y.B.: Research progress of homomorphic cryptography. China Cryptography Development Report 2010, pp. 34–40. Publishing House of Electronics Industry, Beijing (2011)
Benaloh, J.: Dense probabilistic encryption [EB/OL]. In: Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120–128 (1994). http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.3710
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 169–178. ACM, New York (2009)
Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-30576-7_18
Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of 52nd Annual Symp on Foundations of Computer Science, pp. 97–106. IEEE Computer Society, Los Alamitos,CA (2011)
Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309–325. ACM (2012)
Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465–482. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_28
Halevi, S., Shoup, V.: Design and Implementation of a Homomorphic-Encryption Library [EB/OL] (2012). http://eprint.iacr.org/2012/181
Halevi, S., Shoup, V.: Bootstrapping for HElib. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 641–670. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46800-5_25
Halevi, S., Shoup, V.: Faster homomorphic linear transformations in HElib [EB/OL] (2018). https://eprint.iacr.org/2018/244
Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 297–314. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44371-2_17
Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 1–12. ACM (2014)
Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617–640. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46800-5_24
Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3–33. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53887-6_1
Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 377–408. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70694-8_14
Dai, W., Sunar, B.: CUDA-accelerated Fully Homomorphic Encryption Library [EB/OL] (2018). https://github.com/vernamlab/cuFHE
Che, X.L., Zhou, H.N., Yang, X.Y., et al.: Efficient multi-key fully homomorphic encryption scheme from RLWE. J. Xidian Univ. 48(1), 9 (2021)
Acknowledgments
This work was supported by Innovative Research Team in Engineering University of PAP (KYTD201805), National Natural Science Foundation of China (Grant Nos. 62172436, 62102452).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chen, D., Zhou, T., Liu, W., Zhou, Z., Ding, Y., Yang, X. (2023). Construction of a Fully Homomorphic Encryption Scheme with Shorter Ciphertext and Its Implementation on the CUDA Platform. In: Barolli, L. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 161. Springer, Cham. https://doi.org/10.1007/978-3-031-26281-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-26281-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-26280-7
Online ISBN: 978-3-031-26281-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)