On the public citation graph
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
0 signed · 38 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/11817949_5openalex-snapshot
Probability and Nondeterminism in Operational Models of Concurrency
inferredcites →https://doi.org/10.1007/11818175_32openalex-snapshot
Automated Security Proofs with Sequences of Games
inferredcites →https://doi.org/10.1007/11864219_17openalex-snapshot
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
inferredcites →https://doi.org/10.1007/3-540-44929-9_1openalex-snapshot
Reconciling Two Views of Cryptography
inferredcites →https://doi.org/10.1007/3-540-48119-2_43openalex-snapshot
Probabilistic Polynomial-Time Equivalence and Security Analysis
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-540-24611-4_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
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-540-48654-1_35openalex-snapshot
Probabilistic Simulations for Probabilistic Processes
inferredcites →https://doi.org/10.1007/bfb0015027openalex-snapshot
Probabilistic simulations for probabilistic processes
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/j.tcs.2005.10.044openalex-snapshot
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
inferredcites →https://doi.org/10.1109/secpri.2001.924298openalex-snapshot
A model for asynchronous reactive systems and its application to secure message transmission
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.2006.1openalex-snapshot
A computationally sound mechanized prover for security protocols
inferredcites →https://doi.org/10.1109/tit.1983.1056650openalex-snapshot
On the security of public key protocols
inferredcites →https://doi.org/10.1145/352600.352639openalex-snapshot
Composition and integrity preservation of secure reactive systems
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.3233/jcs-2004-12105openalex-snapshot
Completeness theorems for the Abadi–Rogaway language of encrypted expressions1
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-642-15375-4_37openalex-snapshot
Conditional Automata: A Tool for Safe Removal of Negligible Events
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_11openalex-snapshot
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_12openalex-snapshot
Verified Indifferentiable Hashing into Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_1openalex-snapshot
Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_8openalex-snapshot
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.015openalex-snapshot
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/1400751.1400860openalex-snapshot
The power of simulation relations
inferred← citeshttps://doi.org/10.1145/1866307.1866350openalex-snapshot
Computational indistinguishability logic
inferred← citeshttps://doi.org/10.1145/2103621.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferred← citeshttps://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferred← citeshttps://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferred← citeshttps://doi.org/10.20868/upm.thesis.23088openalex-snapshot
Approximate Relational Reasoning for Probabilistic Programs
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.3233/jcs-130476openalex-snapshot
Verified indifferentiable hashing into elliptic curves
inferred← citeshttps://doi.org/10.4204/eptcs.28.1openalex-snapshot
Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior
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.