On the public citation graph
Formal Analysis of Protocols Based on TPM State Registers
0 signed · 70 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-48660-7_29openalex-snapshot
Towards an Automatic Analysis of Security Protocols in First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-540-30232-2_1openalex-snapshot
A Logical Account of NGSCB
inferredcites →https://doi.org/10.1007/978-3-540-74835-9_29openalex-snapshot
Security Evaluation of Scenarios Based on the TCG’s TPM Specification
inferredcites →https://doi.org/10.1007/978-3-642-12459-4_15openalex-snapshot
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
inferredcites →https://doi.org/10.1007/978-3-642-13869-0_16openalex-snapshot
Escrowed Data and the Digital Envelope
inferredcites →https://doi.org/10.1007/978-3-642-19718-5_12openalex-snapshot
Compiling Information-Flow Security to Minimal Trusted Computing Bases
inferredcites →https://doi.org/10.1007/978-3-642-19751-2_8openalex-snapshot
A Formal Analysis of Authentication in the TPM
inferredcites →https://doi.org/10.1007/978-3-8348-9324-6_20openalex-snapshot
Offline dictionary attack on TCG TPM weak authorisation data, and solution
inferredcites →https://doi.org/10.1007/s10207-011-0124-7openalex-snapshot
Principles of remote attestation
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/msp.2006.85openalex-snapshot
Applying protocol analysis to security device interfaces
inferredcites →https://doi.org/10.1109/sp.2009.16openalex-snapshot
A Logic of Secure Systems and its Application to Trusted Computing
inferredcites →https://doi.org/10.1145/1866307.1866348openalex-snapshot
Abstraction by set-membership
inferredcites →https://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1193openalex-snapshot
A formal analysis of Trusted Platform Module 2.0 hash‐based message authentication code authorization under digital rights management scenario
inferred← citeshttps://doi.org/10.1007/978-3-030-31511-5_7openalex-snapshot
Challenges of Using Trusted Computing for Collaborative Data Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-59013-0_26openalex-snapshot
MAC-in-the-Box: Verifying a Minimalistic Hardware Design for MAC Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_5openalex-snapshot
Security Protocols as Choreographies
inferred← citeshttps://doi.org/10.1007/978-3-030-91859-0_9openalex-snapshot
Root-of-Trust Abstractions for Symbolic Analysis: Application to Attestation Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_4openalex-snapshot
Dynamic Measurement and Protected Execution: Model and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-06320-1_12openalex-snapshot
Automated Proof for Authorization Protocols of TPM 2.0 in Computational Model
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_8openalex-snapshot
TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_17openalex-snapshot
A Hybrid Analysis for Security Protocols with State
inferred← citeshttps://doi.org/10.1007/978-3-319-24174-6_7openalex-snapshot
Computational Soundness for Interactive Primitives
inferred← citeshttps://doi.org/10.1007/978-3-319-27152-1_13openalex-snapshot
Formal Support for Standardizing Protocols with State
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_16openalex-snapshot
A Verification Framework for Stateful 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/978-3-642-35371-0_1openalex-snapshot
Automatic Analysis of Security Properties of the TPM
inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_27openalex-snapshot
Verifying a Privacy CA Remote Attestation Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_48openalex-snapshot
The TAMARIN Prover for the Symbolic Analysis of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_2openalex-snapshot
Stateful Applied Pi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_3openalex-snapshot
Computational Soundness Results for ProVerif
inferred← citeshttps://doi.org/10.1007/978-3-662-46666-7_8openalex-snapshot
Automatically Checking Commitment Protocols in ProVerif without False Attacks
inferred← citeshttps://doi.org/10.1007/978-3-662-49635-0_13openalex-snapshot
Computational Soundness Results for Stateful Applied $$\pi $$ π Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-54455-6_5openalex-snapshot
Automated Verification of Dynamic Root of Trust Protocols
inferred← citeshttps://doi.org/10.1007/s11434-014-0575-0openalex-snapshot
Formal analysis of TPM2.0 key management APIs
inferred← citeshttps://doi.org/10.1007/s11434-014-0578-xopenalex-snapshot
The theory and practice in the evolution of trusted computing
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.03.001openalex-snapshot
Stateful applied pi calculus: Observational equivalence and labelled bisimilarity
inferred← citeshttps://doi.org/10.1049/iet-ifs.2016.0005openalex-snapshot
Formal analysis of HMAC authorisation in the TPM2.0 specification
inferred← citeshttps://doi.org/10.1109/csf.2011.10openalex-snapshot
StatVerif: Verification of Stateful Processes
inferred← citeshttps://doi.org/10.1109/csf.2015.38openalex-snapshot
A Logic of Programs with Interface-Confined Code
inferred← citeshttps://doi.org/10.1109/csf.2018.00032openalex-snapshot
A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif
inferred← citeshttps://doi.org/10.1109/eurosp.2017.16openalex-snapshot
Symbolic Models for Isolated Execution Environments
inferred← citeshttps://doi.org/10.1109/saner67736.2026.00103openalex-snapshot
How Well Does Knowledge Injection Enhance LLM-Aided Formal Protocol Modeling?
inferred← citeshttps://doi.org/10.1109/sp.2014.18openalex-snapshot
Automated Analysis of Security Protocols with Global State
inferred← citeshttps://doi.org/10.1109/tce.2018.2873181openalex-snapshot
NFC Secure Element-Based Mutual Authentication and Attestation for IoT Access
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3368131openalex-snapshot
Advancing the Automation Capability of Verifying Security Protocols
inferred← citeshttps://doi.org/10.1109/tifs.2013.2258915openalex-snapshot
Fine-Grained Refinement on TPM-Based Protocol Applications
inferred← citeshttps://doi.org/10.1145/2714576.2714610openalex-snapshot
Formal Analysis of Enhanced Authorization in the TPM 2.0
inferred← citeshttps://doi.org/10.1145/2810103.2813662openalex-snapshot
Automated Symbolic Proofs of Observational Equivalence
inferred← citeshttps://doi.org/10.1145/3157831.3157835openalex-snapshot
Symbolically analyzing security protocols using tamarin
inferred← citeshttps://doi.org/10.1145/3360564openalex-snapshot
Asphalion: trustworthy shielding against Byzantine faults
inferred← citeshttps://doi.org/10.1504/ijsn.2014.060742openalex-snapshot
Security properties analysis in a TPM-based protocol
inferred← citeshttps://doi.org/10.1561/2500000001openalex-snapshot
Formal Models and Techniques for Analyzing Security Protocols: A Tutorial
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.1561/9781601989031openalex-snapshot
Formal Models and Techniques for Analyzing Security Protocols: A Tutorial
inferred← citeshttps://doi.org/10.29007/c4xkopenalex-snapshot
Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA
inferred← citeshttps://doi.org/10.3233/jcs-140501openalex-snapshot
StatVerif: Verification of stateful processes
inferred← citeshttps://doi.org/10.3233/jcs-160556openalex-snapshot
Automated analysis of security protocols with global state
inferred← citeshttps://doi.org/10.3233/jcs-191415openalex-snapshot
Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios
inferred← citeshttps://doi.org/10.3929/ethz-a-009790675openalex-snapshot
Advancing automated security protocol verification
inferred← citeshttps://doi.org/10.48550/arxiv.1403.2237openalex-snapshot
Stateful Security Protocol Verification
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3899openalex-snapshot
A Hybrid Analysis for Security Protocols with State
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05673openalex-snapshot
System M: A Program Logic for Code Sandboxing and Identification
inferred← citeshttps://doi.org/10.48550/arxiv.1603.01244openalex-snapshot
Principles of Layered Attestation
inferred← citeshttps://doi.org/10.48550/arxiv.1806.07209openalex-snapshot
Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA
inferred← citeshttps://doi.org/10.48550/arxiv.1807.00669openalex-snapshot
Verifying Security Protocols using Dynamic Strategies
inferred← citeshttps://doi.org/10.4995/thesis/10251/190915openalex-snapshot
Modeling and Analysis of Advanced Cryptographic Primitives and Security Protocols in Maude-NPA
inferred← citeshttps://doi.org/10.70675/1d79f521zac2fz4c89zae36z5157e79eec3fopenalex-snapshot
Approaches for analyzing security properties of smart objects
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.