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

HILA5 Pindakaas: On the CCA Security of Lattice-Based Encryption with Error Correction

Daniel J. Bernstein, Leon Groot Bruinderink, Tanja Lange, Lorenz Panny

Published Jan 1, 2018• 25 citations
Publisher
DOI
10.1007/978-3-319-89339-6_12

Related papers

HILA5: On Reliability, Reconciliation, and Error Correction for Ring-LWE Encryption

Markku-Juhani Olavi Saarinen

Lecture notes in computer science•Dec 22, 2017•28 citations

An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption

Xiaoyuan Yang, Liqiang Wu, Minqing Zhang +1 more

Computers & Mathematics with Applications•Mar 6, 2012•8 citations

A generic construction of CCA-secure deterministic encryption

Meijuan Huang, Bo Yang, Yi Zhao +3 more

Information Processing Letters•Oct 21, 2019•7 citations

The Efficient CCA Secure Public-Key Encryption Scheme

Kang Li, Zhiyi Wang

Chinese Journal of Computers•May 19, 2011•3 citations

Decryption Failure Attacks on IND-CCA Secure Lattice-Based Schemes

Jan-Pieter D’Anvers, Qian Guo, Thomas Johansson +3 more

Lecture notes in computer science•Jan 1, 2019•73 citations

Disjoint Simulatability and Security Reduction of a Class of Lattice-Based Schemes

Baosheng Huang, Guoqing Zhou, Lin Wang +4 more

Security is the primary consideration for cryptographic algorithms. For key encapsulation mechanisms, it is generally required to satisfy indistinguishability under chosen ciphertext attacks(IND-CCA) in the quantum random oracle model(QROM). The approach of constructing IND-CCA-secure key encapsulation mechanisms from public-key encryption schemes that satisfy disjoint simulatability (DS) is tight. However, existing work on DS either does not consider decryption error rates or requires stronger security properties from the underlying schemes. In this work, we presents a DS-based reduction method that accounts for decryption errors without relying on IND-CPA and this method is applicable to most scenarios of lattice-based encryption schemes including LWE-baced and NTRU-based deterministic public key encryption(DPKE). This work can enhance confidence in the security of lattice-based encryption algorithms in the post-quantum era.

International Conference on Electronics and Communication, Network and Computer Technology (ECNCT)•Jul 1, 2026•0 citations
Security is the primary consideration for cryptographic algorithms. For key encapsulation mechanisms, it is generally required to satisfy indistinguishability under chosen ciphertext attacks(IND-CCA) in the quantum random oracle model(QROM). The approach of constructing IND-CCA-secure key encapsulation mechanisms from public-key encryption schemes that satisfy disjoint simulatability (DS) is tight. However, existing work on DS either does not consider decryption error rates or requires stronger security properties from the underlying schemes. In this work, we presents a DS-based reduction method that accounts for decryption errors without relying on IND-CPA and this method is applicable to most scenarios of lattice-based encryption schemes including LWE-baced and NTRU-based deterministic public key encryption(DPKE). This work can enhance confidence in the security of lattice-based encryption algorithms in the post-quantum era.