@inproceedings{fb20921da94c4a44b54e7dd74b47c85a,
title = "Constraints solution for time sensitive security protocols",
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.",
keywords = "Algorithm, Constraint, Security protocol, Time sensitive",
author = "Zhoujun Li and Ti Zhou and Mengjun Li and Huowang Chen",
year = "2007",
doi = "10.1007/978-3-540-73814-5\_18",
language = "英语",
isbn = "9783540738138",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "191--203",
booktitle = "Frontiers in Algorithmics - First Annual International Workshop, FAW 2007, Proceedings",
address = "德国",
note = "1st International Frontiers in Algorithmics Workshop, FAW 2007 ; Conference date: 01-08-2007 Through 03-08-2007",
}