We revisit the approach defined in  for the formal verification of cryptographic protocols so as to allow for some mechanization in the verification process. In the original approach verification uses theorem proving. Here we show that for a wide range of practical situations and properties it is possible to perform the verification on a finite and safe abstract model. 1 Introduction Formal verification of cryptographic protocols has recently received increased consideration due to the importance of cryptographic protocols in the design of new security or electronic commerce architectures. Many proof-based verification techniques have been proposed (see  for a discussion of this issue) to perform systematic analysis of large protocols. Although these approaches have been quite successful in identifying flaws or as a support for the design of new electronic commerce protocols, they require significant resources during the verification process. Model-checking based techniques ..
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.