Paper 2025/881
One-Way Homomorphic Encryption: A Composite Group Approach
Abstract
Homomorphic Encryption (HE) is a fundamental Privacy-Enhancing Technology (PET) that enables computations on encrypted data without decryption. Despite its utility, designing an efficient and secure HE scheme is highly complex, requiring sophisticated cryptographic techniques. This paper introduces a novel approach to achieving homomorphic properties—supporting either one addition or one multiplication—within composite groups. While the proposed technique exhibits one-wayness, it has a good potential to serve as a foundational building block for constructing indistinguishable cryptosystems. This work contributes to the advancement of homomorphic encryption by providing a new perspective on secure computation within structured algebraic settings.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. International Conference on Cryptology in Africa
- DOI
- 10.1007/978-3-031-97260-7_4
- Keywords
- Homomorphic EncryptionOne way functionComposite groupRabin CryptosystemQuadratic residue.
- Contact author(s)
-
m_mahdavi @ uoc edu
hrifa @ uoc edu - History
- 2026-06-16: revised
- 2025-05-17: received
- See all versions
- Short URL
- https://ia.cr/2025/881
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/881,
author = {Mahdi Mahdavi and Helena Rifà-Pous},
title = {One-Way Homomorphic Encryption: A Composite Group Approach},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/881},
year = {2025},
doi = {10.1007/978-3-031-97260-7_4},
url = {https://eprint.iacr.org/2025/881}
}