Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
In this work, we solve the open problem of designing a fully homomorphic encryption scheme over the integers for non-binary plaintexts in Z Q for prime Q (Q-FHE-OI) without the hardness of the sparse subset sum problem (SSSP). Furthermore, we show that our Q-FHE-OI scheme is a useful optimization fo...
Saved in:
Main Authors: | Aung, Khin Mi Mi, Lee, Hyung Tae, Tan, Benjamin Hong Meng, Wang, Huaxiong |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140697 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
CCA-secure keyed-fully homomorphic encryption
by: LAI, Junzuo, et al.
Published: (2016) -
Improved packing for fully homomorphic encryption with reverse multiplication friendly embeddings
by: Sim, Jun Jie
Published: (2024) -
Analysis of Gong et al.'s CCA2-secure homomorphic encryption
by: Lee, Hyung Tae, et al.
Published: (2017) -
Privacy-preserving graph-based machine learning with fully homomorphic encryption for collaborative anti-money laundering
by: Effendi, Fabrianne
Published: (2024) -
A chameleon encryption scheme resistant to known-plaintext attack
by: Chang, E.-C., et al.
Published: (2013)