TY - GEN
T1 - Data Privacy-Preserving Using Homomorphic Encryption
T2 - 4th International Conference on Advances in Communication Technology and Computer Engineering, ICACTCE 2024
AU - Alblooshi, Majed M.
AU - Lamaazi, Hanane
AU - Ouaissa, Mariya
AU - Ouaissa, Mariam
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025
Y1 - 2025
N2 - Privacy has gained interest recently due to the huge amount of data collected and shared through social media platforms, government institutions, and private companies. This raises huge concerns, especially when data is shared with third parties. Sensitive data, such as employee information, strategic plans, contracts, etc., can be exposed if the third-party controls are ineffective or compromised. Another concern is related to the fact that third parties might retain the information for a longer time than required or misuse the information for a purpose other than the original agreement. Also, the data can be corrupted or altered by a third party during the processing. To address these challenges, Homomorphic encryption (HE) is one of the most optimal techniques to protect sensitive data while processing or sharing it with third parties. This paper proposes a comparative study of different homomorphic encryption schemes, including Paillier, Exponential ElGamal, and Okamoto-Uchiyama, to showcase their impact on preserving the privacy of shared data. As a result, Okamoto-Uchiyama outperforms the benchmarks in terms of execution time for encryption, decryption, and addition operations. However, Exponential ElGamal demonstrated efficient encryption and additional operations, but has the slowest decryption process.
AB - Privacy has gained interest recently due to the huge amount of data collected and shared through social media platforms, government institutions, and private companies. This raises huge concerns, especially when data is shared with third parties. Sensitive data, such as employee information, strategic plans, contracts, etc., can be exposed if the third-party controls are ineffective or compromised. Another concern is related to the fact that third parties might retain the information for a longer time than required or misuse the information for a purpose other than the original agreement. Also, the data can be corrupted or altered by a third party during the processing. To address these challenges, Homomorphic encryption (HE) is one of the most optimal techniques to protect sensitive data while processing or sharing it with third parties. This paper proposes a comparative study of different homomorphic encryption schemes, including Paillier, Exponential ElGamal, and Okamoto-Uchiyama, to showcase their impact on preserving the privacy of shared data. As a result, Okamoto-Uchiyama outperforms the benchmarks in terms of execution time for encryption, decryption, and addition operations. However, Exponential ElGamal demonstrated efficient encryption and additional operations, but has the slowest decryption process.
KW - decryption
KW - Homomorphic encryption
KW - Privacy-preserving
KW - Secret Key
KW - data breach
UR - https://www.scopus.com/pages/publications/105011251588
UR - https://www.scopus.com/pages/publications/105011251588#tab=citedBy
U2 - 10.1007/978-3-031-94620-2_26
DO - 10.1007/978-3-031-94620-2_26
M3 - Conference contribution
AN - SCOPUS:105011251588
SN - 9783031946196
T3 - Lecture Notes in Networks and Systems
SP - 298
EP - 309
BT - Proceedings of the 4th International Conference on Advances in Communication Technology and Computer Engineering, ICACTCE 24 - Transforming Industries
A2 - Iwendi, Celestine
A2 - Boulouard, Zakaria
A2 - Kryvinska, Natalia
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 29 November 2024 through 30 November 2024
ER -