Su Jung Jo, Jae Hyun Choi, Geontae Noh, Ji Young Chun, Ik Rae Jeong, Journal of Internet Computing and Services, Vol. 26, No. 4, pp. 41-54, Aug. 2025
10.7472/jksii.2025.26.4.41, Full Text:  HTML
Keywords: Privacy Preserving, targeted fully homomorphic encryption, semi-honest-but-curious model

Abstract

Recent data processing services demand enhanced privacy and security. To meet these needs, homomorphic encryption presents a promising solution. Extensive research has been conducted on homomorphic encryption based on its intended use and application environment. In particular, fully homomorphic encryption (FHE), which supports arithmetic operations, is computationally intensive and necessitates frequent parameter adjustments due to plaintext representation in circuit form and error accumulation. These limitations make it challenging to apply FHE to various application environments despite its computational advantages. Targeted fully homomorphic encryption (TFHE) offers improved efficiency over FHE for specific operations but has vulnerabilities concerning ciphertext verification. We propose provable targeted fully homomorphic Encryption (PTHE). To facilitate ciphertext verification, we adopt a semi-honest-but-curious model. Additionally, PTHE ensures IND-CPA(Indistinguishability–Chosen Plaintext Attack) security under the DDH(Decisional Diffie-Hellman) assumption.

Statistics
Cite this article