The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Constraint solving for bounded-process cryptographic protocol analysis
Abstract
The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.
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
Cites
The Inductive Approach to Verifying Cryptographic Protocols
Paulson, L. C. (1998) · Cited by 836
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Cited by 582
Strand spaces: why is a security protocol correct?
Fabrega, F. J. T., Herzog, J. C., & Guttman, J. D. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674832 · Cited by 393
Athena: a new efficient automatic checker for security protocol analysis
Song, D. X. (2003) · Proceedings of the 12th IEEE Computer Security Foundations Workshop · doi:10.1109/csfw.1999.779773 · Cited by 203
A model for secure protocols and their compositions
Heintze, N., & Tygar, J. D. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481514 · Cited by 98
Using one-way functions for authentication
Gong, L. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74682 · Cited by 67
Cited by
OFMC: A symbolic model checker for security protocols
Basin, D., Mödersheim, S., & Viganò, L. (2005) · International Journal of Information Security · doi:10.1007/s10207-004-0055-7 · Cited by 504
Verifying privacy-type properties of electronic voting protocols
Delaune, S., Kremer, S., & Ryan, M. (2009) · Journal of Computer Security · doi:10.3233/jcs-2009-0340 · Cited by 285
A modular correctness proof of IEEE 802.11i and TLS
He, C., Sundararajan, M., Datta, A., Derek, A., & Mitchell, J. C. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102124 · Cited by 121
Metadata
- Authors
- Millen, J., & Shmatikov, V.
- Venue
- Proceedings of the 8th ACM conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2001-11-05
- Pages
- 166-175
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2126338744
- Cited by
- 317
- References
- 6
- FWCI
- 11.33
- 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
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.