Cryptology ePrint Archive: Report 2009/079
From Dolev-Yao to Strong Adaptive Corruption: Analyzing Security in the Presence of Compromising Adversaries
David Basin and Cas Cremers
Abstract: We formalize a hierarchy of adversary models for security protocol analysis, ranging from a Dolev-Yao style adversary to more powerful adversaries who can reveal different parts of principals' states during protocol execution. We define our hierarchy by a modular operational semantics describing adversarial capabilities. We use this to formalize various, practically-relevant notions of key and state compromise. Our semantics can be used as a basis for protocol analysis tools. As an example, we extend an existing symbolic protocol-verification tool with our adversary models. The result is the first tool that systematically supports notions such as weak perfect forward secrecy, key compromise impersonation, and adversaries capable of so-called strong corruptions and state-reveal queries. As further applications, we use our model hierarchy to relate different adversarial notions, gaining new insights on their relative strengths, and we use our tool to find new attacks on protocols.
Category / Keywords: foundations / adversary models, state-reveal, perfect forward secrecy, key compromise impersonation, tools
Date: received 12 Feb 2009, last revised 9 Nov 2009
Contact author: cas cremers at inf ethz ch
Available format(s): PDF | BibTeX Citation
Note: A detailed description of the revision history can be found in the appendix of the paper.
Version: 20091109:145451 (All versions of this report)
Short URL: ia.cr/2009/079
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]