Computer Science – Cryptography and Security
Scientific paper
2008-02-23
Computer Science
Cryptography and Security
95 pages
Scientific paper
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully automatic, it can handle an unbounded number of sessions of the protocol, and it is efficient in practice. It significantly extends a previous technique for the verification of secrecy. The protocol is represented in an extension of the pi calculus with fairly arbitrary cryptographic primitives. This protocol representation includes the specification of the correspondence to be verified, but no other annotation. This representation is then translated into an abstract representation by Horn clauses, which is used to prove the desired correspondence. Our technique has been proved correct and implemented. We have tested it on various protocols from the literature. The experimental results show that these protocols can be verified by our technique in less than 1 s.
No associations
LandOfFree
Automatic Verification of Correspondences for Security Protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Automatic Verification of Correspondences for Security Protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic Verification of Correspondences for Security Protocols will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-571570