The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Computer-Aided Security Proofs for the Working Cryptographer
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
Constructing Induction Rules for Deductive Synthesis Proofs
Bundy, A., Dixon, L., Gow, J., & Fleuriot, J. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.08.003 · Cited by 2,806
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
The Coq Proof Assistant - Reference Manual Version 6.1
Filliâtre, J.-C., Herbelin, H., Barras, B., Boutin, S., Giménez, E., Huet, G., Munoz, C. A., Cornes, C., Cornes, C., Courant, J., et al. (1997) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 979
The inductive approach to verifying cryptographic protocols
Paulson, L. C. (1998) · Journal of Computer Security · doi:10.3233/jcs-1998-61-205 · Cited by 898
The Inductive Approach to Verifying Cryptographic Protocols
Paulson, L. C. (1998) · Cited by 836
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Sequences of games: a tool for taming complexity in security proofs.
Shoup, V. (2004) · Cited by 760
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols
Cremers, C. J. F. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70545-1_38 · Cited by 757
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Bellare, M., & Rogaway, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_25 · Cited by 672
Cited by
Gordon, A. D., Henzinger, T. A., Nori, A. V., & Rajamani, S. K. (2014) · Future of Software Engineering Proceedings · doi:10.1145/2593882.2593900 · Cited by 357
SoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
Self-citationMAC-in-the-Box: Verifying a Minimalistic Hardware Design for MAC Computation
Küennemann, R., & Nemati, H. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-59013-0_26
Metadata
- Authors
- Barthe, G., Grégoire, B., Heraud, S., & Béguelin, S. Z.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 71-90
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2123991163
- Cited by
- 256
- References
- 25
- FWCI
- 20.60
- 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: Computer-Aided Security Proofs for the Working Cryptographer. https://app.cochat.ai/papers/10.1007/978-3-642-22792-9_5
- The paper
- Barthe, G., Grégoire, B., Heraud, S., & Béguelin, S. Z. (2011). Computer-Aided Security Proofs for the Working Cryptographer. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-22792-9_5
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.
