liveBook · Manning

Post-compromise security

As explained in Real-World Cryptography

Protocol backward secrecy is the property that fresh entropy after a compromise can restore protection against an attacker who no longer controls the communicating device.

Post-compromise security (PCS), also called backward or future secrecy, lets a protocol recover after keys are exposed. Once an attacker loses access, fresh shared entropy can restore protection for later messages. section 10.4.3 section 8.2

A Double Ratchet restores protection through a repeating exchange-and-derivation cycle:

  • Advertise a ratchet public key with messages. section 10.4.3
  • When a new peer key arrives, perform an ephemeral Diffie–Hellman exchange. section 10.4.3
  • Feed the exchange output into the symmetric ratchet to derive message keys. section 10.4.3
  • Generate and advertise a new local ratchet key, creating a ping-pong of fresh exchanges. section 10.4.3

A compromise, then recovery

Suppose an attacker learns the session secrets during a conversation but later loses access to both devices. The next ratchet exchange introduces entropy the attacker cannot obtain, allowing subsequent keys to become protected again. Recovery fails while the attacker still controls a device. section 10.4.3

Figure 10.19 The Double Ratchet (from Alice’s point of view) combines the DH ratchet (on the left) with the symmetric ratchet (on the right). This provides PCS as well as forward secrecy to the post-X3DH protocol. In the first message, Alice does not yet know Bob’s ratchet key so she uses his presigned key instead.

The combined Double Ratchet diagram shows how the DH ratchet supplies PCS while the symmetric ratchet supplies message-level forward secrecy. section 10.4.3

How Real-World Cryptography covers it

How deep it goes
Explains DH-ratchet exchanges, symmetric derivation, alternating key generation, and the limit imposed by continuing device access.
Examples
Uses Signal messaging, alternating Alice–Bob ratchet keys, and PRNG reseeding after state compromise as concrete examples.
What it assumes
Assumes basic key exchange and message encryption while introducing X3DH, symmetric ratchets, DH ratchets, and entropy recovery.
What you can do after
Understand how a Double Ratchet restores later-message protection after compromise, and when recovery cannot occur.
How it connects
Connects post-compromise security with backward secrecy, forward secrecy, X3DH, Diffie–Hellman ratchets, symmetric ratchets, entropy, and PRNGs.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.