Conference ProceedingsOPEN ACCESS

Towards a mechanization of cryptographic protocol verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1254 131-142
DOI: 10.1007/3-540-63166-6_15
21Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We revisit the approach defined in [2] 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.

Cite

CITATION STYLE

APA

Bolignano, D. (1997). Towards a mechanization of cryptographic protocol verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1254, pp. 131–142). Springer Verlag. https://doi.org/10.1007/3-540-63166-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free