227 search results - page 1 / 46 » On the Reachability Problem in Cryptographic Protocols |
CCS
2001
ACM
13 years 9 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
CONCUR
2000
Springer
13 years 8 months ago
2000
Springer
IEEEARES
2008
IEEE
13 years 11 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
LICS
2003
IEEE
13 years 10 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...