Constraint Abstraction in Verification of Security Protocols

Authors:
Ti Zhou;Zhoujun Li;Mengjun Li;Huowang Chen
Affiliations:
School of Computer Science, National University of Defence Technology, Changsha, China 410073;School of Computer, BeiHang University, Beijing, China 100083;School of Computer Science, National University of Defence Technology, Changsha, China 410073;School of Computer Science, National University of Defence Technology, Changsha, China 410073
Venue:
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Year:
2008

Citing 11
Cited 0

Analyzing security protocols with secrecy types and logic programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysing Time Dependent Security Properties in CSP Using PVS

ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
From Secrecy to Authenticity in Security Protocols

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
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
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
On the security of public key protocols

On the security of public key protocols
A simple framework for real-time cryptographic protocol analysis with compositional proof rules

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Timed model checking of security protocols

Proceedings of the 2004 ACM workshop on Formal methods in security engineering
A simple language for real-time cryptographic protocol analysis

ESOP'03 Proceedings of the 12th European conference on Programming
Constraints solution for time sensitive security protocols

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper incorporates time constraints in the Horn logic model, and this extended model can verify Wide-Mouthed-Frog protocol quickly. It discusses relations between the constraint system and Horn model, abstracts the constraint system, and gives the proofs of some propositions and theorems. We also give the algorithm about how to compute the abstract constraint, and analyze its complexity. As a case study we discuss the verification of Wide-Mouthed-Frog protocol whose attack can be found quickly in new model. Therefore, the method in this paper is very effective in verification of time sensitive security protocols. In the future, we will use this method to verify some complex protocols, such as Kerberos protocol etc.