Meldung

Paper Accepted at CANS' 24 Cambridge

Towards post-quantum secure PAKE - A tight security proof for OCAKE in the BPR model

In collaboration with Kathrin Hövelmanns, Andreas Hülsing, and Silvia Ritsch (Eindhoven University of Technology), Nouri Alnahawi from the ACSD group got their paper accepted for the CANS' (International Conference on Cryptology and Network Security) 2024 in Cambridge, UK.

Link: https://link.springer.com/chapter/10.1007/978-981-97-8016-7_9

Abstract:

We revisit OCAKE (ACNS 23), a generic recipe that constructs password-based authenticated key exchange (PAKE) from key encapsulation mechanisms (KEMs), to allow instantiations with post-quantums KEM like KYBER. The ACNS23 paper left as an open problem to argue security against quantum attackers, with its security proof being in the universal composability (UC) framework. This is common for PAKE, however, at the time of this submission’s writing, it was not known how to prove (computational) UC security against quantum adversaries. Doing this becomes even more involved if the proof uses idealizations like random oracles or ideal ciphers. To pave the way towards post-quantum security proofs, we therefore resort to a (still classical) game-based security proof in the BPR model (EUROCRYPT 2000). We consider this a crucial stepping stone towards a fully satisfying post-quantum security proof. We also hope that a game-based proof is easier to (potentially formally) verify. We prove security of (a minor variation of) OCAKE, assuming the underlying KEM satisfies notions of ciphertext indistinguishability, anonymity, and (computational) public-key uniformity. Using multi-user variants of these properties, we achieve tight security bounds. We provide a full detailed proof – something often omitted in publications on game-based security of PAKE. As a side-contribution, we demonstrate in detail how to handle password guesses, which is something we were unable to find in the existing literature at the time of writing. Finally, we discuss which current PQC KEMs can be plugged into the proposed protocol and provide a concrete instantiation, accompanied by a proof-of-concept implementation and respective run-time benchmarks.

 

Citation: Alnahawi, N., Hövelmanns, K., Hülsing, A., Ritsch, S. (2025). Towards Post-quantum Secure PAKE - A Tight Security Proof for OCAKE in the BPR Model. In: Kohlweiss, M., Di Pietro, R., Beresford, A. (eds) Cryptology and Network Security. CANS 2024. Lecture Notes in Computer Science, vol 14906. Springer, Singapore.