On the public citation graph

Protocol Composition for Arbitrary Primitives

0 signed · 73 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.
Claim with ORCID
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.
See reference health

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/3-540-36576-1_9openalex-snapshot
Verification of Cryptographic Protocols: Tagging Enforces Termination
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-24725-8_24openalex-snapshot
Just Fast Keying in the Pi Calculus
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_16openalex-snapshot
Universal Composition with Joint State
inferredcites →https://doi.org/10.1007/978-3-540-77050-3_29openalex-snapshot
Safely Composing Security Protocols
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_22openalex-snapshot
Cryptographic Protocol Composition via the Authentication Tests
inferredcites →https://doi.org/10.1007/978-3-642-04444-1_21openalex-snapshot
Secure Pseudonymous Channels
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.012openalex-snapshot
Protocol Composition Logic (PCL)
inferredcites →https://doi.org/10.1016/j.scico.2005.02.002openalex-snapshot
Computer-assisted verification of a protocol for certified email
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)90113-4openalex-snapshot
Term rewriting and all that
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1109/csf.2008.6openalex-snapshot
Composition of Password-Based Protocols
inferredcites →https://doi.org/10.1109/csf.2009.9openalex-snapshot
A Method for Proving Observational Equivalence
inferredcites →https://doi.org/10.1109/csf.2010.29openalex-snapshot
Protocol Composition for Arbitrary Primitives
inferredcites →https://doi.org/10.1109/csfw.1997.596779openalex-snapshot
Casper: a compiler for the analysis of security protocols
inferredcites →https://doi.org/10.1109/csfw.2000.856923openalex-snapshot
Protocol independence through disjoint encryption
inferredcites →https://doi.org/10.1109/csfw.2000.856942openalex-snapshot
How to prevent type flaw attacks on security protocols
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/sfcs.2001.959888openalex-snapshot
Universally composable security: a new paradigm for cryptographic protocols
inferredcites →https://doi.org/10.1109/sp.2008.23openalex-snapshot
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
inferredcites →https://doi.org/10.1145/1266977.1266978openalex-snapshot
Just fast keying in the pi calculus
inferredcites →https://doi.org/10.1145/1456396.1456397openalex-snapshot
Formal analysis of SAML 2.0 web browser single sign-on
inferredcites →https://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
inferredcites →https://doi.org/10.3233/jcs-1999-72-304openalex-snapshot
Strand spaces: proving security protocols correct
inferredcites →https://doi.org/10.3233/jcs-2009-0340openalex-snapshot
Verifying privacy-type properties of electronic voting protocols
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-01141-3_2openalex-snapshot
Modular Verification of Sequential Composition for Private Channels in Maude-NPA
inferred← citeshttps://doi.org/10.1007/978-3-031-51479-1_1openalex-snapshot
Layered Symbolic Security Analysis in $$\textsf {DY}^\star $$
inferred← citeshttps://doi.org/10.1007/978-3-319-12400-1_9openalex-snapshot
Non-collaborative Attackers and How and Where to Defend Flawed Security Protocols (Extended Version)
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_8openalex-snapshot
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-24177-7_11openalex-snapshot
Typing and Compositionality for Security Protocols: A Generalization to the Geometric Fragment
inferred← citeshttps://doi.org/10.1007/978-3-319-32525-5_1openalex-snapshot
The Theory of Witness-Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-66402-6_12openalex-snapshot
Modular Verification of Protocol Equivalence in the Presence of Randomness
inferred← citeshttps://doi.org/10.1007/978-3-319-99073-6_21openalex-snapshot
Stateful Protocol Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-19751-2_4openalex-snapshot
Understanding Abstractions of Secure Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_20openalex-snapshot
Implementing Cryptographic Primitives in the Symbolic Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20898-0_14openalex-snapshot
Towards Formal Validation of Trust and Security in the Internet of Services
inferred← citeshttps://doi.org/10.1007/978-3-642-25271-6_1openalex-snapshot
ASLan++ — A Formal Security Specification Language for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27375-9_2openalex-snapshot
Secure Composition of Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-36830-1_14openalex-snapshot
Sessions and Separability in Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-46666-7_17openalex-snapshot
Composing Security Protocols: From Confidentiality to Privacy
inferred← citeshttps://doi.org/10.1007/978-3-662-49635-0_10openalex-snapshot
Composing Protocols with Randomized Actions
inferred← citeshttps://doi.org/10.1109/csf.2011.23openalex-snapshot
Vertical Protocol Composition
inferred← citeshttps://doi.org/10.1109/csf.2012.10openalex-snapshot
Symbolic Analysis of Cryptographic Protocols Containing Bilinear Pairings
inferred← citeshttps://doi.org/10.1109/csf.2012.16openalex-snapshot
Verifying Privacy-Type Properties in a Modular Way
inferred← citeshttps://doi.org/10.1109/csf.2014.26openalex-snapshot
A Sound Abstraction of the Parsing Problem
inferred← citeshttps://doi.org/10.1109/csf.2017.28openalex-snapshot
Secure Composition of PKIs with Public Key Protocols
inferred← citeshttps://doi.org/10.1109/csf.2018.00009openalex-snapshot
Composition Theorems for CryptoVerif and Application to TLS 1.3
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919654openalex-snapshot
Contingent payments from two-party signing and verification for abelian groups
inferred← citeshttps://doi.org/10.1109/ecai.2014.7090214openalex-snapshot
Secrecy by witness-functions on increasing protocols
inferred← citeshttps://doi.org/10.1109/ecai.2015.7301205openalex-snapshot
Secrecy by witness-functions under equational theories
inferred← citeshttps://doi.org/10.1109/smc.2015.213openalex-snapshot
Tracking Security Flaws in Cryptographic Protocols Using Witness-Functions
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833777openalex-snapshot
Formal Model-Driven Discovery of Bluetooth Protocol Design Vulnerabilities
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00220openalex-snapshot
DY* Unchained: Now with Composable Security Proofs and Precise Compromise Scenarios
inferred← citeshttps://doi.org/10.1145/2590296.2590330openalex-snapshot
Sufficient conditions for vertical composition of security protocols
inferred← citeshttps://doi.org/10.1145/3343507openalex-snapshot
Typing Messages for Free in Security Protocols
inferred← citeshttps://doi.org/10.1145/3719027.3744865openalex-snapshot
Breaking and Provably Restoring Authentication: A Formal Analysis of SPDM 1.2 including Cross-Protocol Attacks
inferred← citeshttps://doi.org/10.1145/3776730openalex-snapshot
Cryptis: Cryptographic Reasoning in Separation Logic
inferred← citeshttps://doi.org/10.2168/lmcs-10(2:11)2014openalex-snapshot
Dynamic Tags for Security Protocols
inferred← citeshttps://doi.org/10.3233/jcs-150526openalex-snapshot
Verifying layered security protocols
inferred← citeshttps://doi.org/10.3929/ethz-a-010421618openalex-snapshot
Secure Communication Topologies in the Internet of Things
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2522openalex-snapshot
How to prevent type-flaw and multi-protocol attacks on cryptographic protocols under Exclusive-OR
inferred← citeshttps://doi.org/10.48550/arxiv.1603.00087openalex-snapshot
Effective Sequential Protocol Composition in Maude-NPA
inferred← citeshttps://doi.org/10.4995/thesis/10251/48527openalex-snapshot
Advanced Features in Protocol Verification: Theory, Properties, and Efficiency in Maude-NPA
inferred← citeshttps://doi.org/10.5287/ora-qmgvvyexzopenalex-snapshot
Analysing layered security protocols
inferred← citeshttps://doi.org/10.70675/1be7f5f7zb53dz4abaz9f95z92dbefd6fb07openalex-snapshot
Vérification de propriétés d'indistinguabilité pour les protocoles cryptographiques
inferred← citeshttps://doi.org/10.70675/922a47d5z3b0ez456bza0a4z5e61f3086a0fopenalex-snapshot
Automatic verification of cryptographic protocols : privacy-type properties
inferred← citeshttps://doi.org/10.70675/f40f85f5zbea4z4754z8973zf2e2fbe3430eopenalex-snapshot
Verification and composition of security protocols with applications to electronic voting
showing the first 42 of 43 · page through all 43
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.