Partially Homomorphic Encryption for Supporting Encrypted Data Retrieval in Relational Databases
DOI:
https://doi.org/10.51903/elkom.v18i2.3312Keywords:
Partially Homomorphic, Encryption, Data Retrieval, Relational, DatabaseAbstract
Relational databases store information in interconnected tables and are widely used for data management and retrieval. However, in certain environments, the original values stored in a relational database cannot be exposed during data retrieval. This limitation creates a challenge because common encryption methods only transform data for storage and do not support mathematical operations needed for value matching. Partially Homomorphic Encryption is a cryptographic approach that allows specific mathematical operations to be performed directly on transformed data without restoring it to its original form. This study proposes the use of Partially Homomorphic Encryption to enable value-based data retrieval while keeping all stored values in their transformed form throughout the entire process. The method relies on homomorphic properties that allow mathematical comparison to be conducted on encrypted data, making the retrieval process possible without revealing the original values. The results show that this approach can perform data retrieval operations in a relational database while preserving the transformed structure of the stored data. The proposed method offers an alternative for environments that require data retrieval without exposing original values and demonstrates the potential of homomorphic techniques in supporting secure and functional data processing in relational database contexts.
References
Atmaja Et Al., “Symmetric Cryptography Modification Using Diffie Hellman On,” Vol. 1, No. 1, Pp. 40–48, 2024.
V. N. Agustus, P. Lestari, And A. Pratama, “Dike Jurnal Ilmu Multidiplin Pengolahan Query Yang Menjaga Privasi Dalam Sistem Basis Data Federatif Untuk Data Medis Dike Jurnal Ilmu Multidiplin,” Vol. 3, Pp. 48–51, 2025.
I. P. Wibowo, “Implementasi Paralel Enkripsi Homomorfik Total Kunci Jamak Skema Chen , Dai , Kim , Song ( Cdks )”.
M. S. Informasi, “Studi Perbandingan Skema Enkripsi Homomorfik Dalam Voting System E-Suara,” Vol. 7, No. 1, Pp. 61–65, 2023.
M. Aditya, M. Ghozali, W. Witanti, And G. Abdillah, “Pengamanan Data E-Mail Menggunakan Enkripsi Partially Homomorphic Encryption ( Phe ),” Pp. 445–452, 2018.
J. J. Augustine, “Perancangan Dan Percepatan Enkripsi Homomorfik Total Skema Rns-Ckks Secara Paralel Dengan Gpu”.
M. Hartopo, “Pengembangan Aplikasi E-Voting Menggunakan Enkripsi Homomorfik”.
A. Suwandhi, T. Simanihuruk, F. Sains, T. Informasi, And U. Ibbi, “Homomorphic Encryption & Confidential Computing : Teknologi Untuk Perlindungan Data Dalam Pemrosesan Terenkripsi,” Vol. 14, No. X, Pp. 578–584, 2025.
M. Naufal, Z. Soleh, A. I. Hadiana, And F. Kasyidi, “Kriptografi Homomorfik Dalam Anonimisasi Data Untuk Pengolahan Data Pada Sistem E-Voting,” Vol. D, No. November, 2024, Doi: 10.14710/Jmasif.15.2.66317.
A. M. Rajak And R. D. Agustia, “Purwarupa Sistem E-Voting Menggunakan Enkripsi Prototypes E-Voting System Using Homomorphic Encryption In The General Election Commission Bandung,” Vol. 1, Pp. 1–10, 2021.
M. H. Yahya, C. Chrisanto, And A. A. Arsy, “Optimasi Penggunaan Enkripsi Homomorfik Untuk Keamanan Dan Privasi Data Kesehatan ( Studi Literatur ),” Vol. 13, Pp. 74–78, 2025.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Elkom: Jurnal Elektronika dan Komputer

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






