12 search results - page 1 / 3 » What is the best way to prove a cryptographic protocol corre... |
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
BROADNETS
2006
IEEE
13 years 10 months ago
2006
IEEE
Secure routing protocols for mobile ad hoc networks have been developed recently, yet, it has been unclear what are the properties they achieve, as a formal analysis of these prot...
CTRSA
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
TCS
2002
13 years 4 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
FM
2006
Springer
13 years 8 months ago
2006
Springer
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...