On the public citation graph

Conditional Reactive Simulatability

0 signed · 46 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/11555827_11openalex-snapshot
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
inferredcites →https://doi.org/10.1007/11681878_19openalex-snapshot
Games and the Impossibility of Realizable Ideal Functionality
inferredcites →https://doi.org/10.1007/3-540-44448-3_24openalex-snapshot
Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography
inferredcites →https://doi.org/10.1007/3-540-44448-3_41openalex-snapshot
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
inferredcites →https://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
inferredcites →https://doi.org/10.1007/3-540-44987-6_32openalex-snapshot
Encryption Modes with Almost Free Message Integrity
inferredcites →https://doi.org/10.1007/3-540-45473-x_8openalex-snapshot
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
inferredcites →https://doi.org/10.1007/3-540-46766-1_31openalex-snapshot
Foundations of Secure Interactive Computing
inferredcites →https://doi.org/10.1007/3-540-46766-1_32openalex-snapshot
Secure Computation
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_19openalex-snapshot
A General Composition Theorem for Secure Reactive Systems
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_4openalex-snapshot
Universally Composable Commitments Using Random Oracles
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_26openalex-snapshot
On the Relationships Between Notions of Simulation-Based Security
inferredcites →https://doi.org/10.1007/s00145-008-9021-2openalex-snapshot
General Composition and Universal Composability in Secure Multiparty Computation
inferredcites →https://doi.org/10.1007/s00145-008-9026-xopenalex-snapshot
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
inferredcites →https://doi.org/10.1109/csf.2007.23openalex-snapshot
Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles
inferredcites →https://doi.org/10.1109/csfw.2004.1310742openalex-snapshot
Symmetric encryption in a simulatable Dolev-Yao style cryptographic library
inferredcites →https://doi.org/10.1109/csfw.2004.20openalex-snapshot
Symmetric encryption in a simulatable Dolev-Yao style cryptographic library
inferredcites →https://doi.org/10.1109/icse.2004.1317443openalex-snapshot
Assume-guarantee verification of source code with design-level assumptions
inferredcites →https://doi.org/10.1109/secpri.1998.674821openalex-snapshot
Composing partially-specified systems
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.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
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/sfcs.2003.1238213openalex-snapshot
General composition and universal composability in secure multi-party computation
inferredcites →https://doi.org/10.1109/sfcs.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/1007352.1007394openalex-snapshot
New notions of security
inferredcites →https://doi.org/10.1145/203095.201069openalex-snapshot
Conjoining specifications
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game
inferredcites →https://doi.org/10.1145/509907.509980openalex-snapshot
Universally composable two-party and multi-party secure computation
inferredcites →https://doi.org/10.1145/509907.509982openalex-snapshot
On the composition of authenticated byzantine agreement
inferredcites →https://doi.org/10.1145/948109.948140openalex-snapshot
A composable cryptographic library with nested operations
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs
inferredcites →https://doi.org/10.5555/998675.999426openalex-snapshot
Assume-guarantee verification of source code with design-level assumptions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11863908openalex-snapshot
Computer Security – ESORICS 2006
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_2openalex-snapshot
Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_10openalex-snapshot
Continuous Group Key Agreement with Active Security
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_23openalex-snapshot
Adaptive Security of Multi-party Protocols, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_2openalex-snapshot
On the Insider Security of MLS
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_8openalex-snapshot
The Layered Games Framework for Specifications and Analysis of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-79263-5_15openalex-snapshot
Public-Key Encryption with Non-interactive Opening
inferred← citeshttps://doi.org/10.1007/s10207-007-0046-6openalex-snapshot
Conditional reactive simulatability
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.1145/3576915.3616615openalex-snapshot
ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet
inferred← citeshttps://doi.org/10.1504/ijact.2008.021087openalex-snapshot
The layered games framework for specifications and analysis of security protocols
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.