Modern techniques in somewhat homomorphic encryption
The term “homomorphism” was introduced in cryptography by Rivest, Adleman, and Dertouzos in 1978 to address performing calculations on encrypted data without decryption. Since then, researchers have increasingly aimed to design schemes supporting numerous operations. This article aims to synthesize...
Saved in:
| Main Authors: | Giulietti Massimo, Martinelli Paolo, Timpanella Marco |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2025-04-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2024-0041 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
NTRU-type fully homomorphic encryption scheme without key switching
by: Xin-xia SONG, et al.
Published: (2017-01-01) -
Recent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption
by: Hong Cheng
Published: (2025-01-01) -
Homomorphic Evaluation Cluster Architecture for Fully Homomorphic Encryption
by: Hanyoung Lee, et al.
Published: (2025-01-01) -
BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption
by: Yatao YANG, et al.
Published: (2022-09-01) -
Bootstrapping Optimization Techniques for the FINAL Fully Homomorphic Encryption Scheme
by: Meng Wu, et al.
Published: (2025-03-01)