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

A Lattice-Based IND-CCA Threshold KEM from the BCHK+ Transform

Oleksandra Lapiha, Thomas Prest

Published Dec 7, 2025• 2 citations
Publisher
DOI
10.1007/978-981-95-5099-9_15

Related papers

IND-CCA Lattice Threshold KEM Under 30 KiB

Katharina Boudgoust, Rafaël del Pino, Oleksandra Lapiha +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

An Instantiation of IND-CCA Secure KEM based on Lattice without Random Oracle

김재선

•Jan 1, 2020•0 citations

A Simple and Efficient CCA-Secure Lattice KEM in the Standard Model

Xavier Boyen, Malika Izabachène, Qinyi Li

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

Simple and Efficient CCA-Secure Lattice KEM and PKE in the Standard Model

Xavier Boyen, Malika Izabachène, Qinyi Li

•Feb 16, 2026•0 citations

Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices

Xiaopeng Yang, Wenping Ma, Chengli Zhang

Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.

International Journal of Computer Mathematics•Feb 6, 2016•3 citations

Robust (T,N)-Threshold Lattice Signature

Yunfeng Ji, Yang Tao, Rui Zhang

•Jan 1, 2023•1 citation
Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.