Bruno Blanchet, Andreas Podelski  Home/Search
Context Related
| mpisb.mpg.de/~bla...skiFOSSACS03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~...delskiFOSSACS03 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In experiments with a resolution-based verification method for cryptographic protocols, we could enforce its termination by tagging, a syntactic transformation of messages that leaves attack-free executions invariant. In this paper, we generalize the experimental evidence: we prove that the verification method always terminates for tagged protocols. (Update)
Similar documents based on text: More All
0.4: Escape Analysis for Java. Theory and Practice - Blanchet (2003) (Correct)
0.3: From Secrecy to Authenticity in Security Protocols - Blanchet (2002) (Correct)
0.3: Secrecy Types for Asymmetric Communication - Abadi, Blanchet (2001) (Correct)
Related documents from co-citation: More All
2: Breaking and fixing the Needham-Schroeder public-key protocol using FDR - Lowe - 1996
2: Using Encryption for Authentication in Large Networks of Computers (context) - Roger, Needham et al. - 1978
2: Decidability of context-explicit security protocols (context) - Ramanujam, Suresh - 2005
BibTeX entry: (Update)
@misc{ blanchet-verification,
author = "Bruno Blanchet and Andreas Podelski",
title = "Verification of Cryptographic Protocols: Tagging Enforces Termination",
url = "citeseer.ist.psu.edu/blanchet03verification.html" }
Citations (may not include all citations):322 Breaking and Fixing the Needham-Schroeder Public-Key Protoco.. - Lowe - 1996
302 A Logic of Authentication - Burrows, Abadi et al. - 1989
263 The Inductive Approach to Verifying Cryptographic Protocols - Paulson - 1998
171 Prudent engineering practice for cryptographic protocols - Abadi, Needham - 1996
71 Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
59 Proving Security Protocols with Model Checkers by Data Indep.. - Roscoe, Broadfoot - 1999
54 Authenticity by Typing for Security Protocols - Gordon, Je - 2001
47 Constraint Solving for Bounded-Process Cryptographic Protoco.. - Millen, Shmatikov - 2001
35 Protocol Insecurity with Finite Number of Sessions is NP-com.. - Rusinovitch, Turuani - 2001
33 Analyzing Security Protocols with Secrecy Types and Logic Pr.. - Abadi, Blanchet - 2002
31 Tree Automata with One Memory (context) - Comon, Cortier et al. - 2001
27 How to Prevent Type Flaw Attacks on Security Protocols - Heather, Lowe et al. - 2000
21 On Name Generation and Set-Based Analysis in the Dolev-Yao M.. - Amadio, Charatonik - 2002
15 A Method for Automatic Cryptographic Protocol Veri cation (context) - Goubault-Larrecq - 2000
15 An Ecient Cryptographic Protocol Veri er Based on Prolog Rul.. (context) - Blanchet - 2001
15 Proving secrecy is easy enough - Cortier, Millen et al. - 2001
12 Automating Data Independence - Broadfoot, Lowe et al. - 2000
11 From Secrecy to Authenticity in Security Protocols - Blanchet - 2002
7 Towards automatic veri cation of authentication protocols on.. (context) - Heather, Schneider - 2000
7 Towards an Automatic Analysis of Security Protocols in First.. - Weidenbach - 1999
5 Cryptographic Analysis in Cubic Time - Nielson, Nielson et al. - 2001
3 An Improved Constraint-Based System for the Veri cation of S.. (context) - Corin, Etalle - 2002
2 TAPS: A First-Order Veri er for Cryptographic Protocols (context) - Cohen - 2000
1 Capturing Parallel Attacks within the Data Independence Fram.. (context) - Broadfoot, Roscoe - 2002
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC