On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version)

Details On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version) On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version)

2009-06-05

arxiv.org/abs/0906.1199v1

Computer Science

Logic in Computer Science

Scientific paper

Analysis of cryptographic protocols in a symbolic model is relative to a deduction system that models the possible actions of an attacker regarding an execution of this protocol. We present in this paper a transformation algorithm for such deduction systems provided the equational theory has the finite variant property. the termination of this transformation entails the decidability of the ground reachability problems. We prove that it is necessary to add one other condition to obtain the decidability of non-ground problems, and provide one new such criterion.

Affiliated with

Also associated with

No associations

Rating

On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version) 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 On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61631