A unification-based decision procedure for cryptographic protocol analysis
| Data(s) |
2006
|
|---|---|
| Resumo |
We present a sound and complete decision procedure for the bounded process cryptographic protocol insecurity problem, based on the notion of normal proofs [2] 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 [9] for the same setting. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/41962/1/Unique_pdf.pdf 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. |
| Relação |
http://eprints.iisc.ernet.in/41962/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Conference Paper PeerReviewed |
