Hybrid key establishment secures session keys with downgrade protection
Transcript-Bound Combiners for Downgrade-Resilient Hybrid Post-Quantum Key Establishment: Definition, Proof, and Embedded-Device Cost
Cryptography and Security
Summary
Hybrid key establishment combines old and new encryption methods to keep session keys safe, even if one method is broken. The authors found that if the process doesn’t check the entire conversation (transcript), attackers can remove the new, quantum-proof encryption option. They show that including a hash of the transcript in the key generation stops this attack with very high confidence. Their approach adds a small computational cost but no extra messages, making it practical for devices like embedded systems.
What this means in practice
- •For network protocol developers: Ensure secure session key negotiation resistant to downgrade attacks by integrating transcript binding in hybrid key exchange schemes.
- •For embedded device engineers: Add transcript hashing to hybrid key establishment with minimal energy and computation overhead on Cortex-M4-based devices.
Authors
Bhanwar Gupta, Sanjeev Rana
Abstract
Hybrid key establishment runs a post-quantum key-encapsulation mechanism (KEM) alongside a classical Diffie-Hellman primitive, so that the session key stays secure while either component resists attack. This design is now standardized in the Transport Layer Security protocol, Secure Shell, and the Internet Key Exchange, with the standardized module-lattice KEM (ML-KEM) as the post-quantum component. A hybrid KEM secures the derived key, but not the integrity of the negotiation that selects which primitives are used. Full protocols authenticate that negotiation through a handshake transcript; a hybrid KEM deployed as a standalone drop-in primitive, or inside a minimal handshake without transcript authentication, inherits no such guarantee, and an active attacker can strip the post-quantum option. We ask what the key schedule alone must contain to make downgrade resilience a local property of the combiner. We give a game-based definition at the combiner layer and prove a two-sided separation: a combiner that ignores the transcript is downgraded with certainty, whereas one that binds the session key and the confirmation tag to a hash of the transcript blocks every such attempt, up to a term negligible for a 256-bit transcript hash. We also give an explicit strongest-link security bound. Using a calibrated cost model composed from published Cortex-M4 measurements, transcript binding adds one hash per party - about 11.8% of handshake computation but only 1.5% of radio-inclusive energy - and adds no messages or bytes on the wire. Every reported number is produced by a released harness that passes a 30-check validation gate.