Sciweavers

95 search results - page 6 / 19
» Simulation based security in the applied pi calculus
Sort
View
JLP
2008
75views more  JLP 2008»
13 years 8 months ago
Automated verification of selected equivalences for security protocols
In the analysis of security protocols, methods and tools for reasoning about protocol behaviors have been quite effective. We aim to expand the scope of those methods and tools. W...
Bruno Blanchet, Martín Abadi, Cédric...
RTA
2009
Springer
14 years 3 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...
TGC
2007
Springer
14 years 2 months ago
Access Control Based on Code Identity for Open Distributed Systems
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
Andrew Cirillo, James Riely
LOPSTR
2001
Springer
14 years 1 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
CSFW
2009
IEEE
14 years 3 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune