Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives
Homomorphic Encryption (HE) allows secure and privacy-protected computation on encrypted data without the need to decrypt it. Since Shor’s algorithm rendered prime factorisation and discrete logarithm-based ciphers insecure with quantum computations, researchers have been working on building post-qu...
Saved in:
| Main Authors: | Siddhartha Siddhiprada Bhoi, Arathi Arakala, Amy Beth Corman, Asha Rao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Cryptography |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2410-387X/9/2/31 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Analysis of quantum fully homomorphic encryption schemes (QFHE) and hierarchial memory management for QFHE
by: Shreya Savadatti, et al.
Published: (2025-04-01) -
Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
by: Sergio A Ortega, et al.
Published: (2025-01-01) -
Modern techniques in somewhat homomorphic encryption
by: Giulietti Massimo, et al.
Published: (2025-04-01) -
For Your Eyes Only: A Privacy-Preserving Authentication Framework Based on Homomorphic Encryption and Retina Biometrics
by: David Palma, et al.
Published: (2024-01-01) -
Recent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption
by: Hong Cheng
Published: (2025-01-01)