The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
A calculus for cryptographic protocols: the spi calculus
Open accessAbstract
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols.We show how to use the spi calculus, particularly for studying authentication protocols.The pi calculus (without extension) suffices for some abstract protocols; the spi calculus enables us to consider cryptographic issues in more detail.We represent protocols as processes in the spi calculus and state their security properties in terms of coarse-grained notions of protocol equivalence.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Milner, R. (1989) · Cited by 6,877
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
A calculus of mobile processes, I
Milner, R., Parrow, J., & Walker, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90008-4 · Cited by 2,845
Using encryption for authentication in large networks of computers
Needham, R. M., & Schroeder, M. D. (1978) · Communications of the ACM · doi:10.1145/359657.359659 · Cited by 2,362
Berry, G., & Boudol, G. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90185-i · Cited by 813
Cited by
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
Mobile values, new names, and secure communication
Abadi, M., & Fournet, C. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360213 · Cited by 846
Self-citationKLAIM: a kernel language for agents interaction and mobility
De Nicola, R., Ferrari, G. L., & Pugliese, R. (1998) · IEEE Transactions on Software Engineering · doi:10.1109/32.685256 · Cited by 521
Cardelli, L., & Gordon, A. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0053547 · Cited by 455
Self-citation
Metadata
- Authors
- Abadi, M., & Gordon, A. D.
- Venue
- Proceedings of the 4th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1997-04
- Pages
- 36-47
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W1994676271
- Cited by
- 1,154
- References
- 19
- FWCI
- 27.43
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: A calculus for cryptographic protocols: the spi calculus. https://app.cochat.ai/papers/10.1145/266420.266432
- The paper
- Abadi, M., & Gordon, A. D. (1997). A calculus for cryptographic protocols: the spi calculus. Proceedings of the 4th ACM conference on Computer and communications security. https://doi.org/10.1145/266420.266432
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.
