On the public citation graph
Formal Models and Techniques for Analyzing Security Protocols: A Tutorial
0 signed · 115 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferredcites →https://doi.org/10.1007/10721959_21openalex-snapshot
Rewriting for Cryptographic Protocol Verification
inferredcites →https://doi.org/10.1007/11513988_27openalex-snapshot
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
inferredcites →https://doi.org/10.1007/11539452_19openalex-snapshot
Selecting Theories and Recursive Protocols
inferredcites →https://doi.org/10.1007/3-540-44404-1_10openalex-snapshot
Compiling and Verifying Security Protocols
inferredcites →https://doi.org/10.1007/3-540-44618-4_28openalex-snapshot
On the Reachability Problem in Cryptographic Protocols
inferredcites →https://doi.org/10.1007/3-540-45694-5_33openalex-snapshot
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
inferredcites →https://doi.org/10.1007/3-540-45789-5_24openalex-snapshot
An Improved Constraint-Based System for the Verification of Security Protocols
inferredcites →https://doi.org/10.1007/3-540-48119-2_44openalex-snapshot
A Uniform Approach for the Definition of Security Properties
inferredcites →https://doi.org/10.1007/3-540-48660-7_29openalex-snapshot
Towards an Automatic Analysis of Security Protocols in First-Order Logic
inferredcites →https://doi.org/10.1007/3-540-57220-1_66openalex-snapshot
A practical secret voting scheme for large scale elections
inferredcites →https://doi.org/10.1007/3-540-61042-1_43openalex-snapshot
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_7openalex-snapshot
Deciding Knowledge in Security Protocols Under Equational Theories
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_24openalex-snapshot
Cryptographic Protocol Analysis on Real C Code
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_14openalex-snapshot
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_38openalex-snapshot
The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_54openalex-snapshot
Associative-Commutative Deducibility Constraints
inferredcites →https://doi.org/10.1007/978-3-540-74835-9_40openalex-snapshot
Adaptive Soundness of Static Equivalence
inferredcites →https://doi.org/10.1007/978-3-642-02348-4_11openalex-snapshot
YAPA: A Generic Tool for Computing Intruder Knowledge
inferredcites →https://doi.org/10.1007/978-3-642-02959-2_27openalex-snapshot
Computing Knowledge in Security Protocols under Convergent Equational Theories
inferredcites →https://doi.org/10.1007/978-3-642-03829-7_1openalex-snapshot
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
inferredcites →https://doi.org/10.1007/978-3-642-14577-3_5openalex-snapshot
A Traceability Attack against e-Passports
inferredcites →https://doi.org/10.1007/978-3-642-19751-2_15openalex-snapshot
Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_5openalex-snapshot
Computer-Aided Security Proofs for the Working Cryptographer
inferredcites →https://doi.org/10.1007/978-3-642-28641-4_8openalex-snapshot
Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_6openalex-snapshot
Automated Verification of Equivalence Properties of Cryptographic Protocols
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_15openalex-snapshot
Security Protocols, Constraint Systems, and Group Theories
inferredcites →https://doi.org/10.1007/978-3-642-36830-1_4openalex-snapshot
Proved Generation of Implementations from Computationally Secure Protocol Specifications
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_48openalex-snapshot
The TAMARIN Prover for the Symbolic Analysis of Security Protocols
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_50openalex-snapshot
Lengths May Break Privacy – Or How to Check for Equivalences with Length
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_50openalex-snapshot
APTE: An Algorithm for Proving Trace Equivalence
inferredcites →https://doi.org/10.1007/bfb0014571openalex-snapshot
Secrecy by typing in security protocols
inferredcites →https://doi.org/10.1007/s00145-001-0014-7openalex-snapshot
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
inferredcites →https://doi.org/10.1007/s10817-005-9017-7openalex-snapshot
Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks
inferredcites →https://doi.org/10.1007/s10817-010-9187-9openalex-snapshot
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
inferredcites →https://doi.org/10.1007/s10817-010-9203-0openalex-snapshot
Reducing Equational Theories for the Decision of Static Equivalence
inferredcites →https://doi.org/10.1007/s10817-010-9208-8openalex-snapshot
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0167-4048(92)90222-dopenalex-snapshot
An automatic search for security flaws in key management schemes
inferredcites →https://doi.org/10.1016/0743-1066(95)00095-xopenalex-snapshot
The NRL Protocol Analyzer: An Overview
inferredcites →https://doi.org/10.1016/c2013-0-10567-3openalex-snapshot
Computability, Complexity, and Languages
inferredcites →https://doi.org/10.1016/j.cose.2009.08.001openalex-snapshot
Provably correct Java implementations of Spi Calculus security protocols specifications
inferredcites →https://doi.org/10.1016/j.entcs.2004.10.007openalex-snapshot
Analysing Password Protocol Security Against Off-line Dictionary Attacks
inferredcites →https://doi.org/10.1016/j.ic.2007.05.002openalex-snapshot
The reactive simulatability (RSIM) framework for asynchronous systems
inferredcites →https://doi.org/10.1016/j.ipl.2009.11.004openalex-snapshot
Compiling and securing cryptographic protocols
inferredcites →https://doi.org/10.1016/j.jlap.2007.06.002openalex-snapshot
Automated Verification of Selected Equivalences for Security Protocols
inferredcites →https://doi.org/10.1016/j.tcs.2006.08.032openalex-snapshot
Deciding knowledge in security protocols under equational theories
inferredcites →https://doi.org/10.1016/s0167-6423(02)00132-6openalex-snapshot
Abstracting cryptographic protocols with tree automata
inferredcites →https://doi.org/10.1016/s0304-3975(02)00490-5openalex-snapshot
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
inferredcites →https://doi.org/10.1016/s1571-0661(04)00240-3openalex-snapshot
On the Symbolic Reduction of Processes with Cryptographic Functions
inferredcites →https://doi.org/10.1051/ita/2011119openalex-snapshot
Deciding knowledge in security protocols under some e-voting theories
inferredcites →https://doi.org/10.1109/2.955101openalex-snapshot
API-level attacks on embedded systems
inferredcites →https://doi.org/10.1109/32.713329openalex-snapshot
Verifying authentication protocols in CSP
inferredcites →https://doi.org/10.1109/csf.2009.10openalex-snapshot
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
inferredcites →https://doi.org/10.1109/csf.2009.20openalex-snapshot
ASPIER: An Automated Framework for Verifying Security Protocol Implementations
inferredcites →https://doi.org/10.1109/csf.2010.13openalex-snapshot
Formal Verification of Privacy for RFID Systems
inferredcites →https://doi.org/10.1109/csf.2010.15openalex-snapshot
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus
inferredcites →https://doi.org/10.1109/csf.2010.28openalex-snapshot
Automating Open Bisimulation Checking for the Spi Calculus
inferredcites →https://doi.org/10.1109/csf.2011.10openalex-snapshot
StatVerif: Verification of Stateful Processes
inferredcites →https://doi.org/10.1109/csf.2011.12openalex-snapshot
Formal Analysis of Protocols Based on TPM State Registers
inferredcites →https://doi.org/10.1109/csf.2011.8openalex-snapshot
Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols
inferredcites →https://doi.org/10.1109/csf.2012.25openalex-snapshot
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
inferredcites →https://doi.org/10.1109/csf.2012.9openalex-snapshot
A Framework for the Cryptographic Verification of Java-Like Programs
inferredcites →https://doi.org/10.1109/csfw.1997.596782openalex-snapshot
A hierarchy of authentication specifications
inferredcites →https://doi.org/10.1109/csfw.1997.596790openalex-snapshot
Mechanized proofs for a recursive authentication protocol
inferredcites →https://doi.org/10.1109/csfw.2001.930138openalex-snapshot
An efficient cryptographic protocol verifier based on prolog rules
inferredcites →https://doi.org/10.1109/csfw.2001.930145openalex-snapshot
Protocol insecurity with finite number of sessions is NP-complete
inferredcites →https://doi.org/10.1109/lics.2003.1210067openalex-snapshot
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
inferredcites →https://doi.org/10.1109/secpri.2004.1301317openalex-snapshot
Automatic proof of strong secrecy for security protocols
inferredcites →https://doi.org/10.1109/sfcs.1981.32openalex-snapshot
On the security of public key protocols
inferredcites →https://doi.org/10.1109/sfcs.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
inferredcites →https://doi.org/10.1109/sp.2006.1openalex-snapshot
A computationally sound mechanized prover for security protocols
inferredcites →https://doi.org/10.1109/sp.2006.3openalex-snapshot
A logic for constraint-based security protocol analysis
inferredcites →https://doi.org/10.1109/sp.2014.18openalex-snapshot
Automated Analysis of Security Protocols with Global State
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1145/1030083.1030121openalex-snapshot
A decision procedure for the verification of security protocols with explicit destructors
inferredcites →https://doi.org/10.1145/1102120.1102125openalex-snapshot
Deciding security of protocols against off-line guessing attacks
inferredcites →https://doi.org/10.1145/121132.121160openalex-snapshot
Authentication in distributed systems
inferredcites →https://doi.org/10.1145/1656242.1656244openalex-snapshot
Deciding security properties for cryptographic protocols. application to key cycles
inferredcites →https://doi.org/10.1145/1866307.1866337openalex-snapshot
Attacking and fixing PKCS#11 security tokens
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/2508859.2516679openalex-snapshot
Automatic verification of protocols with lists of unbounded length
inferredcites →https://doi.org/10.1145/359657.359659openalex-snapshot
Using encryption for authentication in large networks of computers
inferredcites →https://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
inferredcites →https://doi.org/10.1145/502006.502007openalex-snapshot
Constraint solving for bounded-process cryptographic protocol analysis
inferredcites →https://doi.org/10.3233/jcs-1998-61-204openalex-snapshot
Casper: A compiler for the analysis of security protocols
inferredcites →https://doi.org/10.3233/jcs-1999-72-304openalex-snapshot
Strand spaces: proving security protocols correct
inferredcites →https://doi.org/10.3233/jcs-2004-12104openalex-snapshot
Analysing protocols subject to guessing attacks
inferredcites →https://doi.org/10.3233/jcs-2009-0339openalex-snapshot
Automatic verification of correspondences for security protocols
inferredcites →https://doi.org/10.3233/jcs-2009-0340openalex-snapshot
Verifying privacy-type properties of electronic voting protocols
inferredcites →https://doi.org/10.3233/jcs-2010-0363openalex-snapshot
Symbolic bisimulation for the applied pi calculus*
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2009.2316openalex-snapshot
Simulation based security in the applied pi calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-02450-5_3openalex-snapshot
The Foul Adversary: Formal Models
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_7openalex-snapshot
Verifying a Blockchain-Based Remote Debugging Protocol for Bug Bounty
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_1openalex-snapshot
Formal Methods for Socio-technical Security
inferred← citeshttps://doi.org/10.1007/978-3-319-92612-4_5openalex-snapshot
Relating Process Languages for Security and Communication Correctness (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-981-95-0172-4_5openalex-snapshot
Utilizing LLM Chatbots for Formal Descriptions of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/s10009-015-0385-yopenalex-snapshot
SATMC: a SAT-based model checker for security protocols, business processes, and security APIs
inferred← citeshttps://doi.org/10.1109/access.2021.3087421openalex-snapshot
Demystifying Attestation in Intel Trust Domain Extensions via Formal Verification
inferred← citeshttps://doi.org/10.1109/cse-euc-dcabes.2016.240openalex-snapshot
A Model-Based Testing Approach for Security Protocols
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00008openalex-snapshot
Solving the Insecurity Problem for Assertions
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00096openalex-snapshot
DY Fuzzing: Formal Dolev-Yao Models Meet Cryptographic Protocol Fuzz Testing
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0304openalex-snapshot
Authentication by Witness Functions
inferred← citeshttps://doi.org/10.1134/s1995080222050195openalex-snapshot
An Approach for Formal Verification of Authentication Protocols
inferred← citeshttps://doi.org/10.1145/3019612.3019826openalex-snapshot
Specification, design, and verification of an accountability-aware surveillance protocol
inferred← citeshttps://doi.org/10.1145/3626232.3653273openalex-snapshot
Remote Registration of Multiple Authenticators
inferred← citeshttps://doi.org/10.1145/3779208.3785377openalex-snapshot
Formal Analysis Framework for E2EE Protocols
inferred← citeshttps://doi.org/10.14722/ndss.2024.24364openalex-snapshot
A Unified Symbolic Analysis of WireGuard
inferred← citeshttps://doi.org/10.26456/mfcsics-21-31openalex-snapshot
Верификация криптографических протоколов
inferred← citeshttps://doi.org/10.3390/s23239500openalex-snapshot
Threat Modeling for Communication Security of IoT-Enabled Digital Logistics
inferred← citeshttps://doi.org/10.70675/88de893eza550z4ba2za7e5z1f929936f6b5openalex-snapshot
Secure, fast and verified cryptographic applications : a scalable approach
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.