Constraints solution for time sensitive security protocols

Authors:
Zhoujun Li;Ti Zhou;Mengjun Li;Huowang Chen
Affiliations:
School of Computer Science, National University of Defence Technology, Changsha, China and School of Computer, BeiHang University, Beijing, China;School of Computer Science, National University of Defence Technology, Changsha, China;School of Computer Science, National University of Defence Technology, Changsha, China;School of Computer Science, National University of Defence Technology, Changsha, China
Venue:
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Year:
2007

Citing 13
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

SIAM Journal on Computing
Improved Algorithms for Linear Inequalities with Two Variables per Inequality

SIAM Journal on Computing
Analyzing security protocols with secrecy types and logic programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to Algorithms

Introduction to Algorithms
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
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

Constraint Abstraction in Verification of Security Protocols

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the development of network and distributed systems, more and more security protocols rely heavily on time stamps, which are taken into account by a few formal methods. Generally, these methods use constraints to describe the characteristic of time variables. However, few of them give a feasible solution to the corresponding constraints solving problem. An effective framework to model and verify time sensitive security protocols is introduced in [1], which doesn't give an automatic algorithm for constraints solution. In this paper, an effective method is presented to determine whether the constraints system has a solution, and then implemented in our verifying tool SPVT. Finally, Denning-Sacco protocol is taken as an example to show that security protocols with time constraints can be modeled naturally and verified automatically and efficiently in our models.