Name
Abstract | ||
|---|---|---|
Quantitative timing is often relevant to the security of systems, like web applications, cyber-physical systems, etc. Verifying timed security protocols is however challenging as both arbitrary attacking behaviors and quantitative timing may lead to undecidability. In this work, we develop a service framework to support intuitive modeling of the timed protocol, as well as automatic verification with an unbounded number of sessions. The partial soundness and completeness of our verification algorithms are formally defined and proved. We implement our method into a tool called TAuth and the experiment results show that our approach is efficient and effective in both finding security flaws and giving proofs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-11737-9_20 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Programming language,False alarm,Cryptographic protocol,Computer science,Real-time computing,Theoretical computer science,Mathematical proof,Authentication protocol,Web application,Soundness,Completeness (statistics),Service framework | Conference | 8829 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.41 |
References | Authors | |
24 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Li | 1 | 76 | 24.03 |
| Jun Sun | 2 | 1407 | 120.35 |
| Yang Liu | 3 | 2194 | 188.81 |
| Jin Song Dong | 4 | 1369 | 107.12 |