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

Implicit Rejection in Fujisaki-Okamoto: Framework and a Novel Realization

Chen Zhao, Xianhui Lu, Dingding Jia, Bao Li

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-22390-7_8

Related papers

A Modular Analysis of the Fujisaki-Okamoto Transformation

Dennis Hofheinz, Kathrin Hövelmanns, Eike Kiltz

Lecture notes in computer science•Jan 1, 2017•463 citations

Post-Quantum Verification of Fujisaki-Okamoto

Dominique Unruh

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

A Note on Failing Gracefully: Completing the Picture for Explicitly Rejecting Fujisaki-Okamoto Transforms Using Worst-Case Correctness

Kathrin Hövelmanns, Christian Majenz

Lecture notes in computer science•Jan 1, 2024•11 citations

Failing Gracefully: Decryption Failures and the Fujisaki-Okamoto Transform

Kathrin Hövelmanns, Andreas Hülsing, Christian Majenz

arXiv:2203.10182•Lecture notes in computer science•Jan 1, 2022•27 citations

On the Complete Non-malleability of the Fujisaki-Okamoto Transform

Daniele Friolo, Matteo Salvino, Daniele Venturi

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

Binding Security of Implicitly-Rejecting KEMs and Application to BIKE and HQC

Juliane Krämer, Patrick Struck, Maximiliane Weishäupl

In this work, we continue the analysis of the binding properties of implicitly-rejecting key-encapsulation mechanisms (KEMs) obtained via the Fujisaki-Okamoto (FO) transform. These binding properties, in earlier literature known under the term robustness, thwart attacks that can arise when using KEMs in complex protocols. Recently, Cremers et al. (CCS'24) introduced a framework for binding notions, encompassing previously existing but also new ones. While implicitly-rejecting FO-KEMs have been analyzed with respect to multiple of these notions, there are still several gaps. We complete the picture by providing positive and negative results for the remaining notions. Further, we show how to apply our results to the code-based KEMs BIKE and HQC, which were round-4 candidates in NIST's PQC standardization process. Through this, we close a second gap as our results complete the analysis of the binding notions for the NIST round-4 KEMs. Finally, we give a modified version of the FO transform that achieves all binding notions.

IACR Communications in Cryptology•Jul 7, 2025•4 citations
In this work, we continue the analysis of the binding properties of implicitly-rejecting key-encapsulation mechanisms (KEMs) obtained via the Fujisaki-Okamoto (FO) transform. These binding properties, in earlier literature known under the term robustness, thwart attacks that can arise when using KEMs in complex protocols. Recently, Cremers et al. (CCS'24) introduced a framework for binding notions, encompassing previously existing but also new ones. While implicitly-rejecting FO-KEMs have been analyzed with respect to multiple of these notions, there are still several gaps. We complete the picture by providing positive and negative results for the remaining notions. Further, we show how to apply our results to the code-based KEMs BIKE and HQC, which were round-4 candidates in NIST's PQC standardization process. Through this, we close a second gap as our results complete the analysis of the binding notions for the NIST round-4 KEMs. Finally, we give a modified version of the FO transform that achieves all binding notions.