Sciweavers

4 search results - page 1 / 1
» A decision procedure for the verification of security protoc...
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
CSFW
2000
IEEE
13 years 11 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider
RTA
2009
Springer
14 years 1 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...