Bhardwaj, Deepak and D’Souza, Deepak (2006) A unification-based decision procedure for cryptographic protocol analysis. In: Proc. 6th International Workshop on Issues in theory of Security (WITS), , 2006, Vienna.
Unique_pdf.pdf - Published Version
Restricted to Registered users only
Download (173Kb) | Request a copy
We present a sound and complete decision procedure for the bounded process cryptographic protocol insecurity problem, based on the notion of normal proofs  and classical unification. We also show a result about the existence of attacks with “high” normal cuts. Our proof of correctness provides an alternate proof and new insights into the fundamental result of Rusinowitch and Turuani  for the same setting.
|Item Type:||Conference Paper|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||10 Nov 2011 05:50|
|Last Modified:||10 Nov 2011 05:50|
Actions (login required)