Security protocol verification: Symbolic and computational models
B Blanchet - International conference on principles of security and …, 2012 - Springer
Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …
paper surveys various approaches in this area, considering the verification in the symbolic …
[PS][PS] An E cient Cryptographic Protocol Verifier Based on Prolog Rules
B Blanchet - 14th IEEE Computer Security Foundations Workshop …, 2001 - csl.sri.com
An E cient Cryptographic Protocol Veri er Based on Prolog Rules Page 1 An E cient
Cryptographic Protocol Veri er Based on Prolog Rules Bruno Blanchet INRIA Rocquencourt …
Cryptographic Protocol Veri er Based on Prolog Rules Bruno Blanchet INRIA Rocquencourt …
OFMC: A symbolic model checker for security protocols
We present the on-the-fly model checker OFMC, a tool that combines two ideas for analyzing
security protocols based on lazy, demand-driven search. The first is the use of lazy data …
security protocols based on lazy, demand-driven search. The first is the use of lazy data …
Scyther: Semantics and verification of security protocols
CJF Cremers - 2006 - research.tue.nl
Recent technologies have cleared the way for large scale application of electronic
communication. The open and distributed nature of these communications implies that the …
communication. The open and distributed nature of these communications implies that the …
Locus solum: From the rules of logic to the logic of rules
JY Girard - Mathematical structures in computer science, 2001 - cambridge.org
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …
Constraint solving for bounded-process cryptographic protocol analysis
J Millen, V Shmatikov - Proceedings of the 8th ACM conference on …, 2001 - dl.acm.org
Constraint solving for bounded-process cryptographic protocol analysis Page 1 Constraint
Solving for Bounded-Process Cryptographic Protocol Analysis Jonathan Millen and Vitaly …
Solving for Bounded-Process Cryptographic Protocol Analysis Jonathan Millen and Vitaly …
Multiset rewriting and the complexity of bounded security protocols
N Durgin, P Lincoln, J Mitchell… - Journal of Computer …, 2004 - content.iospress.com
Abstract We formalize the Dolev–Yao model of security protocols, using a notation based on
multiset rewriting with existentials. The goals are to provide a simple formal notation for …
multiset rewriting with existentials. The goals are to provide a simple formal notation for …
An on-the-fly model-checker for security protocol analysis
We introduce the on-the-fly model-checker OFMC, a tool that combines two methods for
analyzing security protocols. The first is the use of lazy data-types as a simple way of …
analyzing security protocols. The first is the use of lazy data-types as a simple way of …
A survey of algebraic properties used in cryptographic protocols
Cryptographic protocols are successfully analyzed using formal methods. However, formal
approaches usually consider the encryption schemes as black boxes and assume that an …
approaches usually consider the encryption schemes as black boxes and assume that an …