Tools
|
CS 395T - Design and Analysis of Security Protocols (54302)
Fall 2004
Protocol analysis toolsMurphiMurphi is a description language and verifier for finite-state machines, developed at Stanford.
Local installation of Murphi:
/projects/shmat/Murphi3.1 SRI Constraint Solver The Constraint Solver is a symbolic analysis tool for security protocols, developed at SRI. It can handle unbounded message spaces created by the attacker.
Homepage:
http://www.csl.sri.com/users/millen/capsl/constraints.html PRISM PRISM is an experimental probabilistic model checker being developed at the University of Birmingham.
Main PRISM page:
http://www.cs.bham.ac.uk/~dxp/prism/index.html MOCHA MOCHA is a verification system for alternating temporal logic, and can be used for analyzing game-theoretic models of security protocols. It has been developed at UC Berkeley, University of Pennsylvania, and SUNY Stony Brook. MOCHA homepage: http://www-cad.eecs.berkeley.edu/~mocha/ ProVerif ProVerif is a protocol verifier developed by Bruno Blanchet. It can handle an unbounded number of sessions and unbounded message spaces. ProVerif page: http://www.di.ens.fr/~blanchet/crypto-eng.html (downloadables at the bottom) Isabelle Isabelle is a generic theorem proving environment. It has been used by Larry Paulson and others to prove security protocols correct using the inductive method.
Isabelle homepage:
http://www.cl.cam.ac.uk/Research/HVG/Isabelle/
Process algebras for protocol analysis
|