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

Lecture notes in computer science

CCA-Secure Keyed-Fully Homomorphic Encryption

Junzuo Lai, Robert Huijie Deng, Changshe Ma, Kouichi Sakurai, Jian Weng

Published Jan 1, 2016• 18 citations
Publisher
DOI
10.1007/978-3-662-49384-7_4

Related papers

On CCA-Secure Fully Homomorphic Encryption

Jake Loftus, Alexander May, Nigel Paul Smart +1 more

Lecture notes in computer science•Jan 1, 2010•4 citations

SoK: Towards CCA Secure Fully Homomorphic Encryption

Hiroki Okada, Kazuhide Fukushima

International Conference on Security and Cryptography•Jan 1, 2023•0 citations

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

Zvika Brakerski, Vinod Vaikuntanathan

Lecture notes in computer science•Jan 1, 2011•1,115 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

Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions

Colin Boyd, Jaimee Brown, Juan González Nieto

Faculty of Science and Technology; Information Security Institute•Jan 1, 2006•0 citations

CCA-attacks on lattice-based encryption-decryption schemes

Alba Hernández Costoya, Alba Larraya Sancho, Miguel Ángel Marco-Buzunáriz

Abstract This paper presents two distinct chosen-ciphertext attacks (CCA) against lattice-based encryption and decryption schemes, in particular based on the LWE problem, a class of post-quantum cryptographic algorithms. First we attack fully homomorphic encryption-decryption schemes (FHE) exploiting the additional information that the small modulus reduction offers. We compare this attack with the $$CPA^D$$ attack presented in Checri (2024). Afterwards we present an attack against Kyber.CPAPKE, and another against a weakened version of Kyber.KEM where the cyphertext is not checked for correctness; and compare them to the previous Key Mismatch Attack in Qin (2021). Our work remarks the importance of protecting the decryption function in the different implementations of these cryptographic schemes, and the importance of CCA security in nowadays cryptosystems.

Cryptography and Communications•Oct 21, 2025•1 citation
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.
Abstract This paper presents two distinct chosen-ciphertext attacks (CCA) against lattice-based encryption and decryption schemes, in particular based on the LWE problem, a class of post-quantum cryptographic algorithms. First we attack fully homomorphic encryption-decryption schemes (FHE) exploiting the additional information that the small modulus reduction offers. We compare this attack with the CPADCPA^DCPAD attack presented in Checri (2024). Afterwards we present an attack against Kyber.CPAPKE, and another against a weakened version of Kyber.KEM where the cyphertext is not checked for correctness; and compare them to the previous Key Mismatch Attack in Qin (2021). Our work remarks the importance of protecting the decryption function in the different implementations of these cryptographic schemes, and the importance of CCA security in nowadays cryptosystems.