peer reviewedIn the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has been overlooked in all significant protocol verification frameworks based on formal methods. We identify and classify new type-flaw attacks arising from this capability. Several examples of protocols that are vulnerable to this type of attack are given, including Lowe’s modification of KSL. The consequences for automatic verification tools are discussed
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
The standard definition of security for digital signatures—existential unforgeability—does not ensur...
The security of digital communication relies on few cryptographic protocols that are used to protect...
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an i...
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an i...
AbstractIn the context of Dolev-Yao style analysis of security protocols, we consider the capability...
Abstract—Many security protocols are vulnerable to type flaw attacks, in which a protocol message ma...
AbstractIn this paper we report on an analysis for finding known-pair and chosen-text attacks in pro...
International audienceWe address the proof-based development of cryptographic protocols satisfying s...
Since Needham and Schroeder introduced the idea of an ac-tive attacker, a lot of research has been m...
Many security protocols are vulnerable to type-flaw attacks (TFAs), in which a message variable of o...
Security protocols are often specified at the application layer; however, application layer specific...
AbstractIn [19], the authors presented a type-theoretic approach to the verification of security pro...
International audienceWe consider the problem of automating proofs of cryptographic protocols when s...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
The standard definition of security for digital signatures—existential unforgeability—does not ensur...
The security of digital communication relies on few cryptographic protocols that are used to protect...
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an i...
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an i...
AbstractIn the context of Dolev-Yao style analysis of security protocols, we consider the capability...
Abstract—Many security protocols are vulnerable to type flaw attacks, in which a protocol message ma...
AbstractIn this paper we report on an analysis for finding known-pair and chosen-text attacks in pro...
International audienceWe address the proof-based development of cryptographic protocols satisfying s...
Since Needham and Schroeder introduced the idea of an ac-tive attacker, a lot of research has been m...
Many security protocols are vulnerable to type-flaw attacks (TFAs), in which a message variable of o...
Security protocols are often specified at the application layer; however, application layer specific...
AbstractIn [19], the authors presented a type-theoretic approach to the verification of security pro...
International audienceWe consider the problem of automating proofs of cryptographic protocols when s...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
Abstract. The importance of reasoning about recognizability has re-cently been stressed in finding t...
The standard definition of security for digital signatures—existential unforgeability—does not ensur...
The security of digital communication relies on few cryptographic protocols that are used to protect...