Analysis and Comparison of Fully Homomorphic Encryption Approaches over Integers

Date

2027-01-01

Author

Bozkurt, Gansu
Cenk, Murat
Yayla, Oğuz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

1036
views

0
downloads

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), 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.

URI

https://hdl.handle.net/11511/120760

DOI

https://doi.org/10.1007/978-3-032-29251-3_8

Conference Name

19th International Conference on Computational Intelligence in Security for Information Systems-CISIS

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Citation Formats

G. Bozkurt, M. Cenk, and O. Yayla, “Analysis and Comparison of Fully Homomorphic Encryption Approaches over Integers,” Marbella, İspanya, 2027, vol. 3013, Accessed: 00, 2026. [Online]. Available: https://hdl.handle.net/11511/120760.