Sciweavers

2162 search results - page 29 / 433
» A Meta-Notation for Protocol Analysis
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 8 months ago
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
In 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 b...
Pieter Ceelen, Sjouke Mauw, Sasa Radomirovic
CCS
2008
ACM
13 years 10 months ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
IJNSEC
2007
121views more  IJNSEC 2007»
13 years 8 months ago
Injecting Heterogeneity Through Protocol Randomization
In this paper, we argue that heterogeneity should be an important principle in design and use of cryptographic protocols. We use automated formal analysis tools to randomly genera...
Li Zhuang, J. D. Tygar, Rachna Dhamija
TELSYS
2002
126views more  TELSYS 2002»
13 years 8 months ago
Framework and Tool Support for Formal Verification of Highspeed Transfer Protocol Designs
Formal description techniques, verification methods, and their tool-based automated application meanwhile provide valuable support for the formal analysis of communication protocol...
Peter Herrmann, Heiko Krumm, Olaf Drögehorn, ...
CCS
2008
ACM
13 years 10 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers