On the public citation graph
A bisimulation method for cryptographic protocols
0 signed · 133 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/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
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/3-540-63141-0_5openalex-snapshot
Reasoning about cryptographic protocols in the spi calculus
inferredcites →https://doi.org/10.1007/978-3-540-24631-2_4openalex-snapshot
Classification of Security Properties - Part II: Network Security.
inferredcites →https://doi.org/10.1007/bfb0014571openalex-snapshot
Secrecy by typing in security protocols
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0267-3649(94)90017-5openalex-snapshot
Applied cryptography: Protocols, algorithms, and source code in C
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1017/s096012950007002xopenalex-snapshot
Typing and subtyping for mobile processes
inferredcites →https://doi.org/10.1109/49.17707openalex-snapshot
Analyzing encryption protocols using formal verification techniques
inferredcites →https://doi.org/10.1109/csfw.1995.518557openalex-snapshot
Using temporal logic to specify and verify cryptographic protocols
inferredcites →https://doi.org/10.1109/csfw.1997.596788openalex-snapshot
Proving properties of security protocols by induction
inferredcites →https://doi.org/10.1109/secpri.1996.502680openalex-snapshot
Security properties and CSP
inferredcites →https://doi.org/10.1109/tse.1987.233151openalex-snapshot
The Interrogator: Protocol Secuity Analysis
inferredcites →https://doi.org/10.1145/238168.238196openalex-snapshot
An approach to the formal verification of cryptographic protocols
inferredcites →https://doi.org/10.1145/266420.266432openalex-snapshot
A calculus for cryptographic protocols
inferredcites →https://doi.org/10.1145/324133.324266openalex-snapshot
Secrecy by typing in security protocols
inferredcites →https://doi.org/10.3233/jcs-1992-1102openalex-snapshot
Applying Formal Methods to the Analysis of a Key Management Protocol
inferredcites →https://doi.org/10.3233/jcs-1994/1995-3103openalex-snapshot
A Classification of Security Properties for Process Algebras1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferred← citeshttps://doi.org/10.1007/11506881_5openalex-snapshot
Automatic Detection of Attacks on Cryptographic Protocols: A Case Study
inferred← citeshttps://doi.org/10.1007/11599463_108openalex-snapshot
Towards a Symbolic Bisimulation for the Spi Calculus
inferred← citeshttps://doi.org/10.1007/11690634_27openalex-snapshot
Guessing Attacks and the Computational Soundness of Static Equivalence
inferred← citeshttps://doi.org/10.1007/11901914_31openalex-snapshot
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_1openalex-snapshot
Reconciling Two Views of Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_2openalex-snapshot
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45608-2_5openalex-snapshot
Notes on Nominal Calculi for Security and Mobility
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_7openalex-snapshot
Types for Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_6openalex-snapshot
On Compositional Reasoning in the Spi-calculus
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_3openalex-snapshot
The Game of the Name in Cryptographic Tables
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_55openalex-snapshot
Symbolic Trace Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_10openalex-snapshot
A State-Exploration Technique for Spi-Calculus Testing-Equivalence Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_14openalex-snapshot
Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_7openalex-snapshot
Deciding Knowledge in Security Protocols Under Equational Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_11openalex-snapshot
Symbolic Bisimulation in the Spi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_31openalex-snapshot
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_15openalex-snapshot
Exploiting Symmetries for Testing Equivalence in the Spi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_26openalex-snapshot
On the Relationships Between Notions of Simulation-Based Security
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_21openalex-snapshot
Recursion Versus Replication in Simple Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-45215-7_7openalex-snapshot
Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_33openalex-snapshot
Implementing Spi Calculus Using Nominal Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_25openalex-snapshot
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-642-01970-8_6openalex-snapshot
Knowledge Aware Bisimulation and Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_14openalex-snapshot
Formalising Observer Theory for Environment-Sensitive Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-642-04444-1_34openalex-snapshot
Formal Indistinguishability Extended to the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_19openalex-snapshot
A Testing Theory for a Higher-Order Cryptographic Language
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/978-3-662-44584-6_8openalex-snapshot
Bisimulations Up-to: Beyond First-Order Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_7openalex-snapshot
Companions, Codensity and Causality
inferred← citeshttps://doi.org/10.1007/s00145-001-0014-7openalex-snapshot
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
inferred← citeshttps://doi.org/10.1007/s00145-008-9019-9openalex-snapshot
On the Relationships between Notions of Simulation-Based Security
inferred← citeshttps://doi.org/10.1007/s00165-019-00497-wopenalex-snapshot
Bisimulation and Coinduction Enhancements: A Historical Perspective
inferred← citeshttps://doi.org/10.1007/s10009-003-0136-3openalex-snapshot
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
inferred← citeshttps://doi.org/10.1007/s10817-005-9015-9openalex-snapshot
Decidability Issues for Extended Ping-Pong Protocols
inferred← citeshttps://doi.org/10.1016/j.comnet.2005.06.011openalex-snapshot
Using equivalence-checking to verify robustness to denial of service
inferred← citeshttps://doi.org/10.1016/j.csi.2006.06.002openalex-snapshot
Improving the security of industrial networks by means of formal verification
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.099openalex-snapshot
Bisimulation and Co-induction: Some Problems
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.010openalex-snapshot
Open Bisimulation, Revisited
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.078openalex-snapshot
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.001openalex-snapshot
Information flow security in Boundary Ambients
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.06.001openalex-snapshot
Ping-pong protocols as prefix grammars: Modelling and verification via program transformation
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.02.011openalex-snapshot
Linearity and bisimulation
inferred← citeshttps://doi.org/10.1016/j.scico.2004.01.002openalex-snapshot
On the secure implementation of security protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.044openalex-snapshot
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.032openalex-snapshot
Deciding knowledge in security protocols under equational theories
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.032openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.010openalex-snapshot
Open bisimulation, revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.033openalex-snapshot
Cryptographic logical relations
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113842openalex-snapshot
When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00311-1openalex-snapshot
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80530-9openalex-snapshot
Deciding Framed Bisimilarity
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80968-xopenalex-snapshot
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81010-7openalex-snapshot
Information Leakage Detection in Boundary Ambients1 1Partially supported by MIUR Projects “Interpretazione Astratta, Type Systems e Analisi Control-Flow” and “Modelli formali per la sicurezza”, and the EU Contract IST-2001-32617 “Models and Types for Security in Mobile Distributed Systems”.
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80368-8openalex-snapshot
Modal Logics for Cryptographic Processes
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.007openalex-snapshot
Enhancements of the bisimulation proof method
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274481openalex-snapshot
Different approaches for the formal definition of authentication property
inferred← citeshttps://doi.org/10.1109/csf.2010.28openalex-snapshot
Automating Open Bisimulation Checking for the Spi Calculus
inferred← citeshttps://doi.org/10.1109/csf.2016.29openalex-snapshot
Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers
inferred← citeshttps://doi.org/10.1109/csfw.2000.856940openalex-snapshot
Confidentiality for mobile code: the case of a simple payment protocol
inferred← citeshttps://doi.org/10.1109/csfw.2001.930151openalex-snapshot
Logical relations for encryption
inferred← citeshttps://doi.org/10.1109/icatcct44854.2018.9001950openalex-snapshot
A Study of Process Calculus for Formal Verification and Analysis of Security Protocol
inferred← citeshttps://doi.org/10.1109/icccas.2005.1493366openalex-snapshot
Analyzing security protocols by a bisimulation method based on environmental knowledge
inferred← citeshttps://doi.org/10.1109/icccas.2006.284990openalex-snapshot
A Calculus for Cryptographic Communication Protocols-The CCP Calculus
inferred← citeshttps://doi.org/10.1109/isecs.2009.21openalex-snapshot
Analyzing NSPK with the Applied Pi Calculus
inferred← citeshttps://doi.org/10.1109/lics.1999.782608openalex-snapshot
Proof techniques for cryptographic processes
inferred← citeshttps://doi.org/10.1109/lics.2001.932477openalex-snapshot
Probabilistic polynomial-time process calculus and security protocol analysis
inferred← citeshttps://doi.org/10.1109/lics.2004.1319624openalex-snapshot
Bisimulation: from the origins to today
inferred← citeshttps://doi.org/10.1109/lics.2007.17openalex-snapshot
Environmental Bisimulations for Higher-Order Languages
inferred← citeshttps://doi.org/10.1109/lics.2007.4openalex-snapshot
A Complete Axiomatization of Knowledge and Cryptography
inferred← citeshttps://doi.org/10.1109/secpri.2004.1301317openalex-snapshot
Automatic proof of strong secrecy for security protocols
inferred← citeshttps://doi.org/10.1109/snpd.2007.212openalex-snapshot
Non-Functional Attributes Modeling in Software Architecture
inferred← citeshttps://doi.org/10.1109/snpd.2007.213openalex-snapshot
Notice of Violation of IEEE Publication Principles: Network Protocols Analyzing by an Environmental Bisimulation Method
inferred← citeshttps://doi.org/10.1109/snpd.2007.380openalex-snapshot
Communication Optimization on Automatic Program Parallelization
inferred← citeshttps://doi.org/10.1109/tac.2024.3354212openalex-snapshot
A Bisimulation-Based Foundation for Scale Reductions of Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1145/1040305.1040311openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1190215.1190253openalex-snapshot
Secure implementations of typed channel abstractions
inferred← citeshttps://doi.org/10.1145/1284320.1284325openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferred← citeshttps://doi.org/10.1145/266420.266432openalex-snapshot
A calculus for cryptographic protocols
inferred← citeshttps://doi.org/10.1145/2837614.2837651openalex-snapshot
Environmental bisimulations for probabilistic higher-order languages
inferred← citeshttps://doi.org/10.1145/324133.324266openalex-snapshot
Secrecy by typing in security protocols
inferred← citeshttps://doi.org/10.1145/941566.941570openalex-snapshot
Automatic testing equivalence verification of spi calculus specifications
inferred← citeshttps://doi.org/10.1145/964001.964015openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1184/r1/6608948openalex-snapshot
Relating Process Algebras and Multiset Rewriting for Security Protocol Analysis
inferred← citeshttps://doi.org/10.14236/ewic/isiict2009.9openalex-snapshot
EVALUATION TECHNIQUE IN THE SPICALCULUS FOR CRYPTOGRAPHIC PROTOCOLS
inferred← citeshttps://doi.org/10.14419/jacst.v6i1.6713openalex-snapshot
Enhancing formal specification and verification of e-commerce protocol
inferred← citeshttps://doi.org/10.1561/3300000004openalex-snapshot
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
inferred← citeshttps://doi.org/10.2197/ipsjdc.3.343openalex-snapshot
On-the-fly Model Checking of Security Protocols and Its Implementation by Maude
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:14)2019openalex-snapshot
Companions, Causality and Codensity
inferred← citeshttps://doi.org/10.26636/jtit.2002.4.147openalex-snapshot
Process calculi and the verification of security protocols
inferred← citeshttps://doi.org/10.29007/1r2wopenalex-snapshot
Verification of Multi-Party Ping-Pong Protocols via Program Transformation
inferred← citeshttps://doi.org/10.29007/lw7copenalex-snapshot
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
inferred← citeshttps://doi.org/10.3217/jucs-009-11-1350openalex-snapshot
An Information Flow Method to Detect Denial of Service Vulnerabilities
inferred← citeshttps://doi.org/10.3217/jucs-010-09-1156openalex-snapshot
Symbolic Approach to the Analysis of Security Protocols
inferred← citeshttps://doi.org/10.3233/jcs-171013openalex-snapshot
Automated reasoning for equivalences in the applied pi calculus with barriers
inferred← citeshttps://doi.org/10.3233/jcs-2003-11403openalex-snapshot
Logical relations for encryption1
inferred← citeshttps://doi.org/10.3233/jcs-2005-13102openalex-snapshot
Relating multiset rewriting and process algebras for security protocol analysis
inferred← citeshttps://doi.org/10.3233/jcs-2009-0386openalex-snapshot
Guessing attacks and the computational soundness of static equivalence
inferred← citeshttps://doi.org/10.4304/jsw.3.9.44-51openalex-snapshot
An Open Approach for the Applied Pi Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0901.2166openalex-snapshot
A Trace Based Bisimulation for the Spi Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1811.02536openalex-snapshot
A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4007openalex-snapshot
Theory and tool support for the formal verification of cryptographic protocols
inferred← citeshttps://doi.org/10.70675/4304aa95z48b6z400az97ebzd9800ded803bopenalex-snapshot
Higher-order languages : dualities and bisimulation enhancements
inferred← citeshttps://doi.org/10.7146/brics.v10i47.21819openalex-snapshot
Recursive Ping-Pong Protocols
inferred← citeshttps://doi.org/10.7146/brics.v11i23.21848openalex-snapshot
Recursion vs. Replication in Simple Cryptographic Protocols
inferred← citeshttps://doi.org/10.7146/brics.v13i14.21919openalex-snapshot
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
inferred← citeshttps://doi.org/10.7146/brics.v9i25.21741openalex-snapshot
Deciding Framed Bisimilarity
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.