On the public citation graph

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic

https://doi.org/10.1007/11523468_2
0 signed · 102 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/3-540-45539-6_18openalex-snapshot
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
inferredcites →https://doi.org/10.1007/3-540-48329-2_21openalex-snapshot
Entity Authentication and Key Distribution
inferredcites →https://doi.org/10.1007/978-3-030-56880-1openalex-snapshot
Advances in Cryptology – CRYPTO 2020
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-31987-0_12openalex-snapshot
Computationally Sound, Automated Proofs for Security Protocols
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_13openalex-snapshot
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries
inferredcites →https://doi.org/10.1007/978-3-662-49896-5openalex-snapshot
Advances in Cryptology – EUROCRYPT 2016
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/0004-3702(86)90031-7openalex-snapshot
Probabilistic logic
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.008openalex-snapshot
Logics for reasoning about cryptographic constructions
inferredcites →https://doi.org/10.1109/csfw.2003.1212708openalex-snapshot
A derivation system for security protocols and its logical formalization
inferredcites →https://doi.org/10.1109/csfw.2003.1212716openalex-snapshot
The Diffie-Hellman key-agreement scheme in the strand-space model
inferredcites →https://doi.org/10.1109/csfw.2004.1310721openalex-snapshot
Proceedings. 17th IEEE Computer Security Foundations Workshop
inferredcites →https://doi.org/10.1109/csfw.2005.12openalex-snapshot
Compositional Analysis of Contract Signing Protocols
inferredcites →https://doi.org/10.1109/sfcs.2003.1238211openalex-snapshot
Logics for reasoning about cryptographic constructions
inferredcites →https://doi.org/10.1109/tit.1983.1056650openalex-snapshot
On the security of public key protocols
inferredcites →https://doi.org/10.1145/948138.948140openalex-snapshot
A composable cryptographic library with nested operations
inferredcites →https://doi.org/10.3233/jcs-2003-11407openalex-snapshot
A compositional logic for proving security properties of protocols*
inferredcites →https://doi.org/10.3233/jcs-2005-13304openalex-snapshot
A derivation system and compositional logic for security protocols
inferredcites →https://doi.org/10.3233/jcs-2005-13307openalex-snapshot
A computational analysis of the Needham–Schroeder–(Lowe) protocol

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.565openalex-snapshot
Protocol Derivation System for the Needham–Schroeder family
inferred← citeshttps://doi.org/10.1007/11523468_53openalex-snapshot
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
inferred← citeshttps://doi.org/10.1007/11555827_22openalex-snapshot
Soundness of Formal Encryption in the Presence of Key-Cycles
inferred← citeshttps://doi.org/10.1007/11818175_32openalex-snapshot
Automated Security Proofs with Sequences of Games
inferred← citeshttps://doi.org/10.1007/11863908_23openalex-snapshot
Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
inferred← citeshttps://doi.org/10.1007/11863908_25openalex-snapshot
Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes
inferred← citeshttps://doi.org/10.1007/978-3-031-02334-7openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.1007/978-3-540-40981-6_11openalex-snapshot
Modeling Adversaries in a Logic for Security Protocol Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-68914-0_19openalex-snapshot
Analysis of EAP-GPSK Authentication Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_15openalex-snapshot
Inductive Proofs of Computational Secrecy
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_40openalex-snapshot
Adaptive Soundness of Static Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-76929-3_10openalex-snapshot
Computational Semantics for Basic Protocol Logic – A Stochastic Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_9openalex-snapshot
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_14openalex-snapshot
Computational Soundness of Formal Indistinguishability and Static Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_21openalex-snapshot
Formal Proofs of Cryptographic Security of Diffie-Hellman-Based Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-87603-8_40openalex-snapshot
From ABZ to Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_21openalex-snapshot
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
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-02002-5_3openalex-snapshot
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-12459-4_19openalex-snapshot
A User Interface for a Game-Based Protocol Verification Tool
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_3openalex-snapshot
A Symbolic Logic with Exact Bounds for Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_11openalex-snapshot
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker
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-46666-7_4openalex-snapshot
The Foundational Cryptography Framework
inferred← citeshttps://doi.org/10.1007/s10207-007-0040-zopenalex-snapshot
Limits of the BRSIM/UC soundness of Dolev–Yao-style XOR
inferred← citeshttps://doi.org/10.1007/s10207-011-0125-6openalex-snapshot
Cryptographically sound security proofs for basic and public-key Kerberos
inferred← citeshttps://doi.org/10.1007/s10207-013-0192-yopenalex-snapshot
Less is more: relaxed yet composable security notions for key exchange
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.1007/s13369-023-08242-5openalex-snapshot
Quantum-Secure N2N Authentication Protocol Model for IoT Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.012openalex-snapshot
Protocol Composition Logic (PCL)
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.074openalex-snapshot
An Automated Approach for Proving PCL Invariants
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.007openalex-snapshot
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
inferred← citeshttps://doi.org/10.1016/j.ic.2007.05.002openalex-snapshot
The reactive simulatability (RSIM) framework for asynchronous systems
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.005openalex-snapshot
Computationally sound implementations of equational theories against passive adversaries
inferred← citeshttps://doi.org/10.1016/j.ijar.2008.03.005openalex-snapshot
An anytime deduction algorithm for the probabilistic logic and entailment problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.039openalex-snapshot
Compositional analysis of contract-signing protocols
inferred← citeshttps://doi.org/10.1093/logcom/exn014openalex-snapshot
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
inferred← citeshttps://doi.org/10.1109/aina.2012.45openalex-snapshot
Compositional Logic for Proof of Correctness of Proposed UDT Security Mechanisms
inferred← citeshttps://doi.org/10.1109/chinacom.2011.6158270openalex-snapshot
Protocol Derivation System for the Needham-Schroeder family
inferred← citeshttps://doi.org/10.1109/csae.2012.6272646openalex-snapshot
The DH exponentiation extension in a verification logic of local sessions
inferred← citeshttps://doi.org/10.1109/csf.2007.16openalex-snapshot
Computationally Sound Mechanized Proofs of Correspondence Assertions
inferred← citeshttps://doi.org/10.1109/csf.2010.27openalex-snapshot
Towards a Formal Foundation of Web Security
inferred← citeshttps://doi.org/10.1109/csf.2012.8openalex-snapshot
Automatically Verified Mechanized Proof of One-Encryption Key Exchange
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919659openalex-snapshot
Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
inferred← citeshttps://doi.org/10.1109/csfw.2005.12openalex-snapshot
Compositional Analysis of Contract Signing Protocols
inferred← citeshttps://doi.org/10.1109/csfw.2006.10openalex-snapshot
Cryptographically Sound Theorem Proving
inferred← citeshttps://doi.org/10.1109/csfw.2006.9openalex-snapshot
Computationally Sound Compositional Logic for Key Exchange Protocols
inferred← citeshttps://doi.org/10.1109/cybersec.2012.6246084openalex-snapshot
SASy username and password management on the cloud
inferred← citeshttps://doi.org/10.1109/iccis.2013.224openalex-snapshot
Computational Semantics of a Verification Logic of Local Sessions
inferred← citeshttps://doi.org/10.1109/lics.2013.66openalex-snapshot
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
inferred← citeshttps://doi.org/10.1109/sp.2006.1openalex-snapshot
A computationally sound mechanized prover for security protocols
inferred← citeshttps://doi.org/10.1109/tdsc.2007.1005openalex-snapshot
A Computationally Sound Mechanized Prover for Security Protocols
inferred← citeshttps://doi.org/10.1145/1069774.1069788openalex-snapshot
Security analysis of network protocols
inferred← citeshttps://doi.org/10.1145/1102120.1102124openalex-snapshot
A modular correctness proof of IEEE 802.11i and TLS
inferred← citeshttps://doi.org/10.1145/1103576.1103580openalex-snapshot
Towards computationally sound symbolic analysis of key exchange protocols
inferred← citeshttps://doi.org/10.1145/1180405.1180450openalex-snapshot
Computationally sound secrecy proofs by mechanized flow analysis
inferred← citeshttps://doi.org/10.1145/1345189.1345205openalex-snapshot
Logical concepts in cryptography
inferred← citeshttps://doi.org/10.1145/1653662.1653672openalex-snapshot
CoSP
inferred← citeshttps://doi.org/10.1145/2046707.2046716openalex-snapshot
Composability of bellare-rogaway key exchange protocols
inferred← citeshttps://doi.org/10.1145/2046707.2046746openalex-snapshot
Modular code-based cryptographic verification
inferred← citeshttps://doi.org/10.1145/2508859.2516710openalex-snapshot
Computationally complete symbolic attacker and key exchange
inferred← citeshttps://doi.org/10.1145/2508859.2516711openalex-snapshot
Deduction soundness
inferred← citeshttps://doi.org/10.1145/3372297.3417229openalex-snapshot
Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets
inferred← citeshttps://doi.org/10.1184/r1/6468092openalex-snapshot
Towards a Theory of Secure Systems (CMU-CyLab-08-003)
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:21)2012openalex-snapshot
Modeling Adversaries in a Logic for Security Protocol Analysis
inferred← citeshttps://doi.org/10.2200/s00260ed1v01y201003spt002openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.24297/ijct.v9i1.4156openalex-snapshot
Proof of Logic: Correctness of Next Generation Security Mechanisms
inferred← citeshttps://doi.org/10.3233/978-1-60750-714-7-182openalex-snapshot
Protocol Composition Logic
inferred← citeshttps://doi.org/10.3233/978-1-61499-028-4-1openalex-snapshot
Mechanizing Game-Based Proofs of Security Protocols
inferred← citeshttps://doi.org/10.3233/jcs-15774openalex-snapshot
From qualitative to quantitative proofs of security properties using first-order conditional logic
inferred← citeshttps://doi.org/10.3233/jcs-2009-0358openalex-snapshot
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage
inferred← citeshttps://doi.org/10.3233/jcs-2009-0392openalex-snapshot
Computational soundness of symbolic zero-knowledge proofs*
inferred← citeshttps://doi.org/10.3233/jcs-2009-389openalex-snapshot
Inductive trace properties for computational security
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.4204/eptcs.251.21openalex-snapshot
An Epistemic Foundation for Authentication Logics (Extended Abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.0910.5745openalex-snapshot
Quantifying pervasive authentication: the case of the Hancke-Kuhn protocol
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3735openalex-snapshot
The Foundational Cryptography Framework
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07536openalex-snapshot
A Symbolic Logic with Concrete Bounds for Cryptographic Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06389openalex-snapshot
Time Transitive Functions for Zero Knowledge Proofs
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3845openalex-snapshot
Logical concepts in cryptography
inferred← citeshttps://doi.org/10.70675/19a9eee2z00e0z4d2dza27cz506b77c2769dopenalex-snapshot
Proof of security protocols revisited
inferred← citeshttps://doi.org/10.70675/d68c77d4z020dz405ez86adz4690cf53b268openalex-snapshot
Preuves de protocoles cryptographiques : méthodes symboliques et attaquants puissants
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.