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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3 · Cited by 395
Formal certification of code-based cryptographic proofs
Barthe, G., Grégoire, B., & Zanella Béguelin, S. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480894 · Cited by 268
Self-citationA computationally sound mechanized prover for security protocols
Blanchet, B. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.1 · Cited by 221
Secure information flow by self-composition
Barthe, G., D'Argenio, P. R., & Rezk, T. (2004) · Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004. · doi:10.1109/csfw.2004.1310735 · Cited by 177
Self-citationSecure information flow by self-composition
BARTHE, G., D'ARGENIO, P. R., & REZK, T. (2011) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000193 · Cited by 168
Self-citationJönsson, B., Wang, Y., & Larsen, K. G. (2001) · Elsevier eBooks · doi:10.1016/b978-044482830-9/50029-1 · Cited by 150
Topics in Cryptology – CT-RSA 2011
Kiayias, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19074-2 · Cited by 137
Modular verification of security protocol code by typing
Bhargavan, K., Fournet, C., & Gordon, A. D. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706350 · Cited by 107
A plausible approach to computer-aided cryptographic proofs.
Halevi, S. (2005) · Cited by 93
Computationally sound mechanized proofs for basic and public-key Kerberos
Blanchet, B., Jaggard, A. D., Scedrov, A., & Tsay, J.-K. (2008) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1368310.1368326 · Cited by 41
Beyond Provable Security Verifiable IND-CCA Security of OAEP
Barthe, G., Grégoire, B., Lakhnech, Y., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19074-2_13 · Cited by 40
Self-citationProof Checking Technology for Satisfiability Modulo Theories
Stump, A. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2008.12.121 · Cited by 33
A Formal Language for Cryptographic Pseudocode
Michael Backes, A., Berg, M., & Unruh, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89439-1_26 · Cited by 30
Inductive Proofs of Computational Secrecy
Roy, A., Datta, A., Đerek, A., & Mitchell, J. C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74835-9_15 · Cited by 18
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
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
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
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.