Verifying Security Protocols Modelled by Networks of Automata

Authors:
Mirosław Kurkowski;Wojciech Penczek
Affiliations:
Institute of Mathematics and Computer Science, Jan Długosz University Armii Krajowej 13/15, 42-200 Czȩstochowa, Poland. E-mail: m.kurkowski@ajd.czest.pl;Institute of Computer Science, Polish Academy of Sciences Ordona 21, 01-237 Warsaw, Poland and Institute of Informatics, Podlasie Academy, Sienkiewicza 51, 08-110 Siedlce, Poland. E-mail: penczek@ ...
Venue:
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Year:
2007

Citing 17
Cited 1

An approach to the formal verification of cryptographic protocols

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Using CSP to Detect Errors in the TMN Protocol

IEEE Transactions on Software Engineering
Casper: a compiler for the analysis of security protocols

Journal of Computer Security
Using encryption for authentication in large networks of computers

Communications of the ACM
Verifying security protocols with Brutus

ACM Transactions on Software Engineering and Methodology (TOSEM)
Symbolic Model Checking

Symbolic Model Checking
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Analysing Time Dependent Security Properties in CSP Using PVS

ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Using state space exploration and a natural deduction style message derivation engine to verify security protocols

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
TAPS: A First-Order Verifier for Cryptographic Protocols

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Timed model checking of security protocols

Proceedings of the 2004 ACM workshop on Formal methods in security engineering
SAT-based Reachability Checking for Timed Automata with Diagonal Constraints

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
SAT-Based Verification of Security Protocols Via Translation to Networks of Automata

Model Checking and Artificial Intelligence
√erics: a tool for verifying timed automata and estelle specifications

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The AVISPA tool for the automated validation of internet security protocols and applications

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Timed Automata Based Model Checking of Timed Security Protocols

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model checking. These automata correspond to executions of the participants as well as to their knowledge about letters. Given a bounded number of sessions, we can verify both correctness or incorrectness of a security protocol proving either reachability or unreachability of an undesired state. We exemplify all our notions on the Needham Schroeder Public Key Authentication Protocol (NSPK) and show experimental results for checking authentication using the verification tool VerICS.