227 search results - page 6 / 46 » On the Reachability Problem in Cryptographic Protocols |
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
14 years 29 days ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
CSFW
2002
IEEE
14 years 13 days ago
2002
IEEE
We present the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of our ...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...