Research topics / Post-compromise security
Post-compromise security
If an adversary learns a party’s secrets, can that party subsequently communicate securely again? We call such guarantees post-compromise security (PCS). Our work formalizes this question and studies the conditions under which these guarantees can be achieved.
The answer depends on the threat model and on the system in which the protocol is used. We study recovery in key exchange and messaging, including the effects of cloned devices, membership in multiple groups, and session handling. We also prove impossibility results for communication systems that must tolerate certain forms of state loss. These results distinguish the guarantees of a protocol component from those available to the users of a complete system.
Suggested reading
These papers develop the notion and foundations of post-compromise security and examine its guarantees and limitations in communication systems.
-
On Post-Compromise SecurityOn Post-Compromise Security
In this work we study communication with a party whose secrets have already been compromised. At first sight, it may seem impossible to provide any type of security in this scenario. However, under some conditions, practically relevant guarantees can still be achieved. We call such guarantees ``post-compromise security''.
We provide the first informal and formal definitions for post-compromise security, and show that it can be achieved in several scenarios. At a technical level, we instantiate our informal definitions in the setting of authenticated key exchange (AKE) protocols, and develop two new strong security models for two different threat models. We show that both of these security models can be satisfied, by proposing two concrete protocol constructions and proving they are secure in the models.
Our work leads to crucial insights on how post-compromise security can (and cannot) be achieved, paving the way for applications in other domains.
Details
Katriel Cohn-Gordon, Cas Cremers, and Luke Garratt.
IEEE CSF 2016, Proc. of the 29th IEEE Computer Security Foundations Symposium, 2016.
[Long version] [bibtex]We introduce the notion of post-compromise security and give informal and formal definitions. We instantiate them for authenticated key exchange, and give constructions for two different threat models.
-
Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice
Details
Cas Cremers, Jaiden Fairoze, Benjamin Kiesl, and Aurora Naska.
ACM CCS 2020, Virtual, November 2020.
[pdf] [bibtex] [Tamarin models]This paper studies clone detection as a means of improving post-compromise security in messaging. The accompanying Tamarin models are linked below.
-
The Complexities of Healing in Secure Group Messaging: Why Cross-Group Effects Matter
Details
Cas Cremers, Britta Hale, and Konrad Kohbrok.
USENIX 2021, Virtual, August 2021.
[pdf] [bibtex]We examine healing in group messaging, where a party can participate in several groups. The work studies why interactions between groups matter for recovery after compromise.
-
Formal Analysis of Session-Handling in Secure Messaging: Lifting Security from Sessions to Conversations
Details
Cas Cremers, Charlie Jacomme, and Aurora Naska.
USENIX 2023, August 2023.
[eprint] [pdf] [bibtex]We show how session handling can prevent a conversation from recovering even when its individual ratcheting chains provide post-compromise security, and analyze mechanisms for stronger guarantees.
-
Impossibility Results for Post-Compromise Security in Real-World Communication Systems
Details
Cas Cremers, Niklas Medinger, and Aurora Naska.
IEEE Symposium on Security & Privacy, San Francisco, May 2025.
[eprint] [bibtex]We prove limits on post-compromise security for systems that must tolerate certain forms of state loss. The results expose a trade-off between failure resilience and security.
Research: Secure messaging; Post-compromise security
Further reading
-
3PaaS: Privacy-Preserving Post-Compromise Security as a Service
Details
Cas Cremers, Abhinav Nakarmi, Aleksi Peltonen, and Eyal Ronen.
ACM CCS 2026, The Hague, November 2026.
[eprint]Research: Post-compromise security; Applied cryptography -
ETK: External-Operations TreeKEM and the Security of MLS in RFC 9420
Details
Cas Cremers, Esra Günsay, Vera Wesselkamp, and Mang Zhao.
Eurocrypt 2026, Rome, May 2026.
[eprint] -
TokenWeaver: Privacy Preserving and Post-Compromise Secure Attestation
Details
Cas Cremers, Gal Horowitz, Charlie Jacomme, and Eyal Ronen.
IEEE Symposium on Security & Privacy, San Francisco, May 2025.
[eprint] [bibtex]Research: Post-compromise security -
Secure Messaging with Strong Compromise Resilience, Temporal Privacy, and Immediate Decryption
Details
Cas Cremers and Mang Zhao.
IEEE Symposium on Security & Privacy (Oakland), May 2024.
[eprint] [bibtex] -
A Formal Security Analysis of the Signal Messaging ProtocolA Formal Security Analysis of the Signal Messaging Protocol
Signal is a new security protocol that provides end-to-end encryption for instant messaging. It has recently been adopted by WhatsApp, Facebook Messenger and Google Allo among many others; the first two of these have at least 1 billion active users. Signal includes several uncommon security properties (such as ``future secrecy'' or ``post-compromise security''), enabled by a novel technique called ratcheting in which session keys are updated with every message sent. Despite its importance and novelty, there has been little to no academic analysis of the Signal protocol.
We conduct the first security analysis of Signal's Key Agreement and Double Ratchet as a multi-stage key exchange protocol. We extract from the implementation a formal description of the abstract protocol, define a security model which can capture the ``ratcheting'' key update structure, and prove the security of Signal's core in our model. Our presentation and results can serve as a starting point for other analyses of this widely adopted protocol.
Details
Katriel Cohn-Gordon, Cas Cremers, Benjamin Dowling, Luke Garratt, and Douglas Stebila.
Journal of Cryptology, 2020.
[Springer] [bibtex] -
On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees
Details
Katriel Cohn-Gordon, Cas Cremers, Luke Garratt, Jon Millican, and Kevin Milner.
ACM CCS 2018: Proceedings of the 25th ACM Conference on Computer and Communications Security, Toronto, Canada, 2018.
[pdf] [bibtex] -
A Formal Security Analysis of the Signal Messaging ProtocolA Formal Security Analysis of the Signal Messaging Protocol
Signal is a new security protocol that provides end-to-end encryption for instant messaging. It has recently been adopted by WhatsApp, Facebook Messenger and Google Allo among many others; the first two of these have at least 1 billion active users. Signal includes several uncommon security properties (such as ``future secrecy'' or ``post-compromise security''), enabled by a novel technique called ratcheting in which session keys are updated with every message sent. Despite its importance and novelty, there has been little to no academic analysis of the Signal protocol.
We conduct the first security analysis of Signal's Key Agreement and Double Ratchet as a multi-stage key exchange protocol. We extract from the implementation a formal description of the abstract protocol, define a security model which can capture the ``ratcheting'' key update structure, and prove the security of Signal's core in our model. Our presentation and results can serve as a starting point for other analyses of this widely adopted protocol.
Details
Katriel Cohn-Gordon, Cas Cremers, Benjamin Dowling, Luke Garratt, and Douglas Stebila.
IEEE EuroS&P 2017.
[full version (eprint)] [bibtex]