The DOI matches its Crossref record.
Athena: a new efficient automatic checker for security protocol analysis
Abstract
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authentication, secrecy and properties related to electronic commerce. We have developed an automatic procedure for evaluating well-formed formulae in this logic. For a well-formed formula, if the evaluation procedure terminates, it will generate a counter example if the formula is false, or provide a proof if the formula is true. Even when the procedure does not terminate when we allow any arbitrary configurations of the protocol execution, (for example, any number of initiators and responders), termination could be forced by bounding the number of concurrent protocol runs and the length of messages, as is done in most existing model checkers. Athena also exploits several state space reduction techniques. It is based on an extension of the Strand Space Model (Thayer et al., 1998) which captures exact causal relation information. Together with backward search and other techniques, Athena naturally avoids the state space explosion problem commonly caused by asynchronous composition and symmetry redundancy. Athena also has the advantage that it can easily incorporate results from theorem proving through unreachability theorems. By using the unreachability theorems, it can prune the state space at an early stage, hence, reduce the state space explored and increase the likelihood of termination. As shown in our experiments, these techniques dramatically reduce the state space that needs to be explored.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Drielsma, P. H., Heám, P. C., Kouchnarenko, O., Mantovani, J., et al. (2005) · Lecture Notes in Computer Science · doi:10.1007/11513988_27 · Cited by 1,343
An efficient cryptographic protocol verifier based on prolog rules
Blanchet, B. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930138 · Cited by 967
Automated Security Protocol Analysis With the AVISPA Tool
Viganò, L. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.11.052 · Cited by 452
Constraint solving for bounded-process cryptographic protocol analysis
Millen, J., & Shmatikov, V. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502007 · Cited by 317
Injective synchronisation: An extension of the authentication hierarchy
Cremers, C. J. F., Mauw, S., & de Vink, E. P. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.08.034 · Cited by 61
Metadata
- Authors
- Song, D. X.
- Venue
- Proceedings of the 12th IEEE Computer Security Foundations Workshop
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 192-202
- ISSN
- 1063-6900 (ISSN-L)
- OpenAlex
- W1779054477
- Cited by
- 203
- References
- 0
- FWCI
- 12.16
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Athena: a new efficient automatic checker for security protocol analysis. https://app.cochat.ai/papers/10.1109/csfw.1999.779773
- The paper
- Song, D. X. (2003). Athena: a new efficient automatic checker for security protocol analysis. Proceedings of the 12th IEEE Computer Security Foundations Workshop. https://doi.org/10.1109/csfw.1999.779773
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.