The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
Abstract
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties such as xor, we extend the conventional Dolev-Yao model by permitting the intruder to exploit these properties. We show that the ground reachability problem in NP for the extended intruder theories in the cases of xor and Abelian groups. This result follows from a normal proof theorem. Then, we show how to lift this result in the xor case: we consider a symbolic constraint system expressing the reachability (e.g., secrecy) problem for a finite number of sessions. We prove that such a constraint system is decidable, relying in particular on an extension of combination algorithms for unification procedures. As a corollary, this enables automatic symbolic verification of cryptographic protocols employing xor for a fixed number of sessions.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
Blanchet, B. (2016) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000004 · Cited by 321
Metadata
- Authors
- Comon-Lundh, H., & Shmatikov, V.
- Venue
- 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-12-22
- Pages
- 271-280
- OpenAlex
- W2130123502
- Cited by
- 164
- References
- 1
- FWCI
- 8.73
- 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: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. https://app.cochat.ai/papers/10.1109/lics.2003.1210067
- The paper
- Comon-Lundh, H., & Shmatikov, V. (2003). Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings. https://doi.org/10.1109/lics.2003.1210067
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.