119 search results - page 6 / 24 » Finite models for formal security proofs |
TYPES
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
CTRSA
2005
Springer
14 years 1 months ago
2005
Springer
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
SP
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
IJISEC
2007
13 years 7 months ago
2007
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
FM
2006
Springer
13 years 11 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...