Partial Order Reductions for Security Protocol Verification

Authors:
Edmund M. Clarke;Somesh Jha;Wilfredo R. Marrero
Affiliations:
-;-;-
Venue:
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
Year:
2000

Citing 11
Cited 2

A logic of authentication

ACM Transactions on Computer Systems (TOCS)
Using partial-order methods in the formal validation of industrial concurrent programs

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Using encryption for authentication in large networks of computers

Communications of the ACM
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
Combining Partial Order Reductions with On-the-fly Model-Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Language generation and verification in the NRL protocol analyzer

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Intensional specifications of security protocols

CSFW '96 Proceedings of the 9th 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
Efficient Finite-State Analysis for Large Security Protocols

CSFW '98 Proceedings of the 11th 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
iKP: a family of secure electronic payment protocols

WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1

Taming the Adversary

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Checking secrecy by means of partial order reduction

SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explore partial order reduction that make the task of verifying cryptographic protocols more efficient. These reduction techniques have been implemented in our tool BRUTUS. A lthough we have implemented several reduction techniques in our tool BRUTUS, due to space restrictions in this paper we only focus on partial order reductions. Partial order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial order reductions in the context of verifying security protocols and prove their correctness. Experimental results showing the benefits of this reduction technique are also presented.