On the public citation graph

Timed Spi-Calculus with Types for Secrecy and Authenticity

0 signed · 45 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.1006/inco.1995.1041openalex-snapshot
A Process Algebra for Timed Systems
inferredcites →https://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferredcites →https://doi.org/10.1007/10722599openalex-snapshot
Computer security - ESORICS 2000 : 6th European Symposium on Research in Computer Security, Toulouse, France, October 4-6, 2000 : proceedings
inferredcites →https://doi.org/10.1007/10722599_14openalex-snapshot
Analysing Time Dependent Security Properties in CSP Using PVS
inferredcites →https://doi.org/10.1007/11539452_17openalex-snapshot
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
inferredcites →https://doi.org/10.1007/11539452_31openalex-snapshot
Transactions in RCCS
inferredcites →https://doi.org/10.1007/3-540-36532-x_17openalex-snapshot
Typing One-to-One and One-to-Many Correspondences in Security Protocols
inferredcites →https://doi.org/10.1007/3-540-36575-3_9openalex-snapshot
A Simple Language for Real-Time Cryptographic Protocol Analysis
inferredcites →https://doi.org/10.1007/3-540-45315-6_2openalex-snapshot
Secrecy Types for Asymmetric Communication
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_27openalex-snapshot
Automatic Verification of Time Sensitive Cryptographic Protocols
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
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/978-3-540-28644-8_19openalex-snapshot
Reversible Communicating Systems
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/s0304-3975(02)00863-0openalex-snapshot
Secrecy types for asymmetric communication
inferredcites →https://doi.org/10.1016/s1571-0661(04)80960-5openalex-snapshot
Key Compromise, Strand Spaces, and the Authentication Tests1 1I gave my MFPS 17 talk on 24 May 2001, Bob Dylan's sixtieth birthday. This paper is dedicated to him.
inferredcites →https://doi.org/10.1098/rspa.1989.0125openalex-snapshot
A logic of authentication
inferredcites →https://doi.org/10.1109/32.481513openalex-snapshot
Prudent engineering practice for cryptographic protocols
inferredcites →https://doi.org/10.1109/csfw.2000.856942openalex-snapshot
How to prevent type flaw attacks on security 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.1145/358722.358740openalex-snapshot
Timestamps in key distribution protocols
inferredcites →https://doi.org/10.1145/359657.359659openalex-snapshot
Using encryption for authentication in large networks of computers
inferredcites →https://doi.org/10.25405/ncl.34123404openalex-snapshot
The Modelling and Analysis of Security Protocols: the CSP Approach
inferredcites →https://doi.org/10.3233/jcs-1998-61-205openalex-snapshot
The inductive approach to verifying cryptographic protocols
inferredcites →https://doi.org/10.3233/jcs-2003-11402openalex-snapshot
Authenticity by typing for security protocols1
inferredcites →https://doi.org/10.3233/jcs-2004-123-406openalex-snapshot
Types and effects for asymmetric cryptographic protocols

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-24098-5_5openalex-snapshot
Pattern-Matching Spi-Calculus
inferred← citeshttps://doi.org/10.1007/11817949_18openalex-snapshot
Dynamic Access Control in a Concurrent Object Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-75227-1_2openalex-snapshot
Timed Calculus of Cryptographic Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-41157-1_2openalex-snapshot
Affine Refinement Types for Authentication and Authorization
inferred← citeshttps://doi.org/10.1016/j.ic.2006.04.004openalex-snapshot
\nPattern-Matching Spi-Calculus
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.06.002openalex-snapshot
Automated type-based analysis of injective agreement in the presence of compromised principals
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.05.005openalex-snapshot
Cryptographic protocol logic: Satisfaction for (timed) Dolev–Yao cryptography
inferred← citeshttps://doi.org/10.1017/s096012951500002xopenalex-snapshot
Linked data privacy
inferred← citeshttps://doi.org/10.1109/icumt.2012.6459786openalex-snapshot
Modeling and verification of network protocol specs using timed pi-calculus
inferred← citeshttps://doi.org/10.1109/isias.2011.6122838openalex-snapshot
Time and energy cost analysis of Kerberos security protocol in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tase.2012.27openalex-snapshot
A Native Approach to Modeling Timed Behavior in the Pi-Calculus
inferred← citeshttps://doi.org/10.1145/1345189.1345205openalex-snapshot
Logical concepts in cryptography
inferred← citeshttps://doi.org/10.1145/1455770.1455816openalex-snapshot
Type-checking zero-knowledge
inferred← citeshttps://doi.org/10.1145/2873052openalex-snapshot
Foundations of Session Types and Behavioural Contracts
inferred← citeshttps://doi.org/10.1145/2911992openalex-snapshot
inferred← citeshttps://doi.org/10.22028/d291-26373openalex-snapshot
Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3845openalex-snapshot
Logical concepts in cryptography
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.