On the public citation graph
Deciding Key Cycles for Security Protocols
0 signed · 41 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.1007/11513988_27openalex-snapshot
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
inferredcites →https://doi.org/10.1007/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferredcites →https://doi.org/10.1007/11555827_22openalex-snapshot
Soundness of Formal Encryption in the Presence of Key-Cycles
inferredcites →https://doi.org/10.1007/3-540-36576-1_9openalex-snapshot
Verification of Cryptographic Protocols: Tagging Enforces Termination
inferredcites →https://doi.org/10.1007/3-540-44881-0_12openalex-snapshot
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols
inferredcites →https://doi.org/10.1007/3-540-44929-9_1openalex-snapshot
Reconciling Two Views of Cryptography
inferredcites →https://doi.org/10.1007/3-540-48329-2_21openalex-snapshot
Entity Authentication and Key Distribution
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-24597-1_31openalex-snapshot
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_8openalex-snapshot
Soundness of Formal Encryption in the Presence of Active Adversaries
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_12openalex-snapshot
A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps
inferredcites →https://doi.org/10.1007/bfb0055718openalex-snapshot
Relations among notions of security for public-key encryption schemes
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.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/j.jlap.2004.09.007openalex-snapshot
A symbolic decision procedure for cryptographic protocols with time stamps
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.018openalex-snapshot
Verification of cryptographic protocols: tagging enforces termination
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/s0898-1221(98)91141-5openalex-snapshot
Theory of linear and integer programming
inferredcites →https://doi.org/10.1109/csf.2007.23openalex-snapshot
Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles
inferredcites →https://doi.org/10.1109/csfw.1997.596782openalex-snapshot
A hierarchy of authentication specifications
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.2004.1310742openalex-snapshot
Symmetric encryption in a simulatable Dolev-Yao style cryptographic library
inferredcites →https://doi.org/10.1109/csfw.2004.20openalex-snapshot
Symmetric encryption in a simulatable Dolev-Yao style cryptographic library
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.1145/359657.359659openalex-snapshot
Using encryption for authentication in large networks of computers
inferredcites →https://doi.org/10.1145/501983.502007openalex-snapshot
Constraint solving for bounded-process cryptographic protocol analysis
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
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-540-75560-9_15openalex-snapshot
Verifying Cryptographic Protocols with Subterms Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_29openalex-snapshot
Safely Composing Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_31openalex-snapshot
Bounding Messages for Free in Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_9openalex-snapshot
From One Session to Many: Dynamic Tags for Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_5openalex-snapshot
Verification of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_2openalex-snapshot
Security Protocol Verification: Symbolic and Computational Models
inferred← citeshttps://doi.org/10.1007/s10703-008-0059-4openalex-snapshot
Safely composing security protocols
inferred← citeshttps://doi.org/10.1007/s10817-010-9187-9openalex-snapshot
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2014.09.003openalex-snapshot
Bounding messages for free in security protocols – extension to various security properties
inferred← citeshttps://doi.org/10.1145/1653662.1653674openalex-snapshot
Computational soundness for key exchange protocols with symmetric encryption
inferred← citeshttps://doi.org/10.1145/1656242.1656244openalex-snapshot
Deciding security properties for cryptographic protocols. application to key cycles
inferred← citeshttps://doi.org/10.3923/itj.2011.1068.1091openalex-snapshot
A Survey on Analysis of Selected Cryptographic Primitives and Security Protocols in Symbolic Model and Computational Model
inferred← citeshttps://doi.org/10.62056/ae0zo-3yopenalex-snapshot
Circular Insecure Encryption: from Long Cycles to Short Cycles
inferred← citeshttps://doi.org/10.70675/922a47d5z3b0ez456bza0a4z5e61f3086a0fopenalex-snapshot
Automatic verification of cryptographic protocols : privacy-type properties
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.