Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Consumer Electronics

Key Recovery of the Edge-Based Quantum-Secure Fully Homomorphic Encryption Scheme

Jiseung Kim, Hyung Tae Lee

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1109/tce.2026.3730849

Related papers

An Edge-Based and Quantum-Secure Fully Homomorphic Encryption Scheme A presentation explaining the theoretical and practical Regulator-Based Encryption (RBE) technique

Abdelkader Laouid

•Jan 1, 2026•0 citations

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

Joppe W. Bos, Kristin Lauter, Jake Loftus +1 more

Lecture notes in computer science•Jan 1, 2013•428 citations

CCA-Secure Leveled FHE From Multi-Identity Fully Homomorphic Encryption

Weili Wang, Bin Hu, Xiufeng Zhao

This paper proposes a generic construction of CCA-secure fully homomorphic encryption (FHE) scheme.First, we introduce a new primitive called multi-identity fully homomorphic encryption, which works in the multi-identity setting; that is, homomorphic evaluation can performed on ciphertexts created with different identities.Then, we propose an IND-sID-CPA secure multi-identity leveled FHE scheme over lattice.Finally, we present CCA-secure FHE from our proposed multi-identity FHE scheme and strongly EUF-CMA secure signature.The security analysis shows that our FHE scheme is CCA2-secure when the evaluation key is unavailable to the adversary, and remains CCA1-secure when the evaluation key is exposed in the standard model.

Joint International Information Technology, Mechanical and Electronic Engineering Conference (JIMEC)•Jan 1, 2017•0 citations

Quantum Fully Homomorphic Encryption with Verification

Gorjan Alagic, Yfke Dulek, Christian Schaffner +1 more

arXiv:1708.09156•Lecture notes in computer science•Jan 1, 2017•37 citations

A quantum approach to homomorphic encryption

Tan, S.H., Kettlewell, J.A., Ouyang, Y. +2 more

•Sep 23, 2016•56 citations

Efficient fully homomorphic encryption with circularly secure key switching process

Xiaoyuan Yang, Wei Zhang, Liqiang Wu +1 more

Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper, the 'special b' variant of the learning with errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearisation process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski's scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack (CPA) security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem (LWE) assumption.

International Journal of High Performance Computing and Networking•Jan 1, 2016•0 citations
This paper proposes a generic construction of CCA-secure fully homomorphic encryption (FHE) scheme.First, we introduce a new primitive called multi-identity fully homomorphic encryption, which works in the multi-identity setting; that is, homomorphic evaluation can performed on ciphertexts created with different identities.Then, we propose an IND-sID-CPA secure multi-identity leveled FHE scheme over lattice.Finally, we present CCA-secure FHE from our proposed multi-identity FHE scheme and strongly EUF-CMA secure signature.The security analysis shows that our FHE scheme is CCA2-secure when the evaluation key is unavailable to the adversary, and remains CCA1-secure when the evaluation key is exposed in the standard model.
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper, the 'special b' variant of the learning with errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearisation process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski's scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack (CPA) security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem (LWE) assumption.