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

Lossy Key Encapsulation Mechanism and Its Applications

Yamin Liu, Xianhui Lu, Bao Li, Haiyang Xue

Published Jan 1, 2017• 1 citation
Publisher
DOI
10.1007/978-3-319-53177-9_6

Related papers

Hybrid Key Encapsulation Mechanisms and Authenticated Key Exchange

Nina Bindel, Jacqueline Brendel, Marc Fischlin +2 more

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

Identification Schemes from Key Encapsulation Mechanisms

Hiroaki Anada, Seiko Arita

Lecture notes in computer science•Jan 1, 2011•10 citations

Compact and Simple RLWE Based Key Encapsulation Mechanism

Erdem Alkım, Yusuf Alper Bilgin, Murat Cenk

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

Algorithms of asymmetric encryption and encapsulation of keys of post-quantum period of 5 -7 stability stability levels and their applications

І.Д. Горбенко, О.Г. Качко, O.M. Oleksijchuk +5 more

The asymmetric encryption and keys encapsulation in polynomial rings (algebraic lattices) built algorithms are presented and considered, the essence of used asymmetric encryption transformations and key encapsulation protocols are analyzed. Encryption and encapsulation mechanisms with different sets of parameters that determine stability are considered.

Radiotekhnika•Oct 25, 2019•2 citations

A Constructive Perspective on Key Encapsulation

Sandro Coretti, Ueli M. Maurer, Björn Tackmann

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

Post-Quantum Anonymity of Key Encapsulation Mechanism and Its Applications in Password Authenticated Key Exchange Protocols

JiaYv An, Yankun Gao, Lei Han

Driven by advances in the standardization of NIST’s Post-Quantum Cryptography (PQC) algorithms, research on constructing Password Authenticated Key Exchange (PAKE) protocols using Key Encapsulation Mechanisms (KEMs) has gained considerable attention. Several PAKE protocols have established precise security requirements for the underlying KEM. Arriaga et al. introduced a PAKE protocol called CHIC, which requires the KEM to achieve anonymity under plaintext-checkable attacks (ANO-1PCA). An anonymous KEM does not leak any information about which public key was used for encryption. It protects the identities and privacy of participants and is critical in preventing identity-guessing attacks, therefore, anonymity is also called key-privacy. The anonymity of NIST PQC Round-3 candidates has recently been analyzed, some of which satisfied ANO-CCA.Huguenin-Dumittan and Vaudenay proposed two efficient constructions, TCHand TH, to create KEM from public-key encryption (PKE) schemes. Jiang et al. introduced TRHbased on TH. These constructions can transform any OW-CPA PKE into an IND-qCCA KEM efficiently and avoid re-encryption. However, prior to this work, no research has been conducted to determine whether these constructions preserve or lift anonymity.In this paper, we proved that for any OW-CPA, DS-IND PKE, the construction KEMRH= TRH[PKE,H] achieves ANO1-CCA in the quantum random oracle model (QROM). We then construct a KEM called KyberRH, and provide an algorithm for the CHIC protocol using KyberRH.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Nov 14, 2025•0 citations
Driven by advances in the standardization of NIST’s Post-Quantum Cryptography (PQC) algorithms, research on constructing Password Authenticated Key Exchange (PAKE) protocols using Key Encapsulation Mechanisms (KEMs) has gained considerable attention. Several PAKE protocols have established precise security requirements for the underlying KEM. Arriaga et al. introduced a PAKE protocol called CHIC, which requires the KEM to achieve anonymity under plaintext-checkable attacks (ANO-1PCA). An anonymous KEM does not leak any information about which public key was used for encryption. It protects the identities and privacy of participants and is critical in preventing identity-guessing attacks, therefore, anonymity is also called key-privacy. The anonymity of NIST PQC Round-3 candidates has recently been analyzed, some of which satisfied ANO-CCA.Huguenin-Dumittan and Vaudenay proposed two efficient constructions, TCHand TH, to create KEM from public-key encryption (PKE) schemes. Jiang et al. introduced TRHbased on TH. These constructions can transform any OW-CPA PKE into an IND-qCCA KEM efficiently and avoid re-encryption. However, prior to this work, no research has been conducted to determine whether these constructions preserve or lift anonymity.In this paper, we proved that for any OW-CPA, DS-IND PKE, the construction KEMRH= TRH[PKE,H] achieves ANO1-CCA in the quantum random oracle model (QROM). We then construct a KEM called KyberRH, and provide an algorithm for the CHIC protocol using KyberRH.