Analysis and Comparison of Fully Homomorphic Encryption Approaches over Integers
19th International Conference on Computational Intelligence in Security for Information Systems-CISIS, Marbella, Spain, 18 - 19 June 2026, vol.3013, pp.92-103, (Full Text)
- Publication Type: Conference Paper / Full Text
- Volume: 3013
- Doi Number: 10.1007/978-3-032-29251-3_8
- City: Marbella
- Country: Spain
- Page Numbers: pp.92-103
- Middle East Technical University Affiliated: Yes
Abstract
Performing computations on encrypted data by first decrypting it causes security flaws. Fully Homomorphic Encryption (FHE) algorithms enable computations on encrypted data without decryption, overcoming the limitations of traditional schemes. This study analyzes the van Dijk-Gentry-Halevi-Vaikuntanathan (DGHV) scheme and Batch DGHV schemes, comparing their efficiency in encrypting l-bit messages. Our analysis indicates that Batch DGHV achieves superior efficiency over the original DGHV when the message length l satisfies l <= lambda(3/2), where lambda denotes the security parameter. In cloud computing, this is significant for processing high-dimensional data or aggregating multiple encrypted messages. For messages of length (t broken vertical bar s) where l broken vertical bar s > lambda(3/2), we propose a hybrid approach: applying Batch DGHV to the initial bits and the original DGHV to the remaining s bits. This partitioned strategy optimizes computational efficiency compared to the exclusive use of a single scheme. These findings demonstrate that selecting between original and Batch DGHV must be informed by both asymptotic bounds and specific message lengths to balance computational overhead and data throughput in secure cloud environments.