Checking secrecy by means of partial order reduction

Authors:
Cas J. F. Cremers;Sjouke Mauw
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Year:
2004

Citing 6
Cited 1

Constraint solving for bounded-process cryptographic protocol analysis

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Partial Order Reductions for Security Protocol Verification

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
An Improved Constraint-Based System for the Verification of Security Protocols

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Ten Years of Partial Order Reduction

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Hierarchy of Authentication Specifications

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Casper: A Compiler for the Analysis of Security Protocols

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations

Compositionality of Security Protocols: A Research Agenda

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction, we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.