OFMC: A symbolic model checker for security protocols

Basin, David; Mödersheim, Sebastian; Viganò, Luca

doi:10.1007/s10207-004-0055-7

Cited by 401 publications

(291 citation statements)

References 40 publications

Supporting

Mentioning

288

Contrasting

Unclassified

Order By: Relevance

“…It not only allows reasoning about the high-level security property, abstracting from the low-level details of the cryptographic implementation, but it also helps to reduce the problem to a size that can be handled efficiently by automatic verification tools [7,8,9,10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Java Code Generation of Security Protocols Specified in AnB/AnBx

Modesti

2014

Security and Trust Management

View full text Add to dashboard Cite

The implementation of security protocols is challenging and error-prone, as experience has proved that even widely used and heavily tested protocols like TLS and SSH need to be patched every year due to low-level implementation bugs. A model-driven development approach allows automatic generation of an application, from a simpler and abstract model that can be formally verified. In this work we present the AnBx compiler, a tool for automatic generation of Java code of security protocols specified in the popular Alice & Bob notation, suitable for agile prototyping. In contrast with the existing tools, the AnBx compiler uses a simpler specification language and computes the consistency checks that agents has to perform on reception of messages. This is an important feature for robust implementations. Moreover, the tool applies various optimization strategies to achieve efficiency both at compile time and at run time. A support library interfaces the Java Cryptographic Architecture allowing for easy customization of the application. AbstractThe implementation of security protocols is challenging and error-prone, as experience has proved that even widely used and heavily tested protocols like TLS and SSH need to be patched every year due to low-level implementation bugs. A model-driven development approach allows automatic generation of an application, from a simpler and abstract model that can be formally verified. In this work we present the AnBx compiler, a tool for automatic generation of Java code of security protocols specified in the popular Alice & Bob notation, suitable for agile prototyping. In contrast with the existing tools, the AnBx compiler uses a simpler specification language and computes the consistency checks that agents has to perform on reception of messages. This is an important feature for robust implementations. Moreover, the tool applies various optimization strategies to achieve efficiency both at compile time and at run time. A support library interfaces the Java Cryptographic Architecture allowing for easy customization of the application. About the authors Suggested keywords SECURITY PROTOCOLS JAVA CODE GENERATION APPLIED FORMAL METHODSEfficient Java Code Generation of Security Protocols specified in AnB/AnBx Paolo ModestiSchool of Computing Science, Newcastle University, UK paolo.modesti@newcastle.ac.ukAbstract. The implementation of security protocols is challenging and error-prone, as experience has shown that even widely used and heavily tested protocols like TLS and SSH need to be patched every year due to low-level implementation bugs. A model-driven development approach allows the automatic generation of an application, from a simpler and abstract model that can be formally verified. In this work we present the AnBx compiler, a tool for automatic generation of Java code of security protocols specified in the popular Alice & Bob notation, suitable for agile prototyping. In contrast with existing tools, the AnBx compiler uses a simpler specification language and computes t...

show abstract

Section: Introductionmentioning

confidence: 99%

“…-it works for an entire protocol suite (more than 40) and not just on few examples. The suite includes complex protocols like SET, iKP, Kerberos, ISO H530, Google SSO and others, many of them derived from the AnB examples included in the OFMC model-checker [8].…”

Section: Introductionmentioning

confidence: 99%

Efficient Java Code Generation of Security Protocols Specified in AnB/AnBx

Modesti

2014

Security and Trust Management

View full text Add to dashboard Cite

show abstract

“…In particular, many algorithms and tools (see [13,4,9,2,11] to cite a few) have been designed to automatically find flaws in protocols or prove security. Most of these results focus on reachability properties such as authentication or secrecy: for any execution of the protocol, an attacker should never learn a secret (secrecy property) or make Alice think she's talking to Bob while Bob did not engage a conversation with her (authentication property).…”

Section: Introductionmentioning

confidence: 99%

From Security Protocols to Pushdown Automata

Chrétien

Cortier

Delaune

2013

Automata, Languages, and Programming

View full text Add to dashboard Cite

Abstract. Formal methods have been very successful in analyzing security protocols for reachability properties such as secrecy or authentication. In contrast, there are very few results for equivalence-based properties, crucial for studying e.g. privacy-like properties such as anonymity or vote secrecy. We study the problem of checking equivalence of security protocols for an unbounded number of sessions. Since replication leads very quickly to undecidability (even in the simple case of secrecy), we focus on a limited fragment of protocols (standard primitives but pairs, one variable per protocol's rules) for which the secrecy preservation problem is known to be decidable. Surprisingly, this fragment turns out to be undecidable for equivalence. Then, restricting our attention to deterministic protocols, we propose the first decidability result for checking equivalence of protocols for an unbounded number of sessions. This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata.

show abstract

“…All these examples are evidences that relaxing the perfect encryption hypothesis by considering equational theories is an important issue in security. In order to achieve this goal some tools have been developed for considering some algebraic properties [7,8,20,25,26,44].…”

Section: Introductionmentioning

confidence: 99%

Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties

Lafourcade

Terrade

Vigier

2010

Formal Aspects in Security and Trust

View full text Add to dashboard Cite

Abstract. Recently Kuesters et al proposed two new methods using ProVerif for analyzing cryptographic protocols with Exclusive-Or and Diffie-Hellman properties. Some tools, for instance CL-Atse and OFMC, are able to deal with Exclusive-Or and Diffie-Hellman. In this article we compare time efficiency of these tools verifying some protocols of the litterature that are designed with such algebraic properties.

show abstract

OFMC: A symbolic model checker for security protocols

Cited by 401 publications

References 40 publications

Efficient Java Code Generation of Security Protocols Specified in AnB/AnBx

Efficient Java Code Generation of Security Protocols Specified in AnB/AnBx

From Security Protocols to Pushdown Automata

Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties

Contact Info

Product

Resources

About