Theory of linear and integer programming
Theory of linear and integer programming
Adding time to a logic of authentication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Timestamps in key distribution protocols
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Fault-perserving simplifying transformations for security protocols
Journal of Computer Security
Analyzing security protocols with secrecy types and logic programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On modeling real-time mobile processes
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
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
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
Timed model checking of security protocols
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
On Timed Models and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
A simple language for real-time cryptographic protocol analysis
ESOP'03 Proceedings of the 12th European conference on Programming
| Hi-index | 0.00 |
This paper researches the characteristic of time sensitive protocols and presents a method with simple operations to verify protocols with time stamps and avoid false attacks. Firstly, an extension of @p calculus is given to model a time sensitive security protocol. And then, by appending linear arithmetic constraints to the Horn logic model, the extended Horn logic model of security protocols and the modified-version verification method with time constraints are represented. All operations and the strategy of verification are defined for our constraints system. Thirdly, a method is given to determine whether the constraints has a solution or not. Finally, as a result of an experiment, Denning-Sacco protocol with time stamps is verified. The experiment shows that our approach is an innovative and effective method on verifying time sensitive security protocols.