On the public citation graph
Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles
0 signed · 62 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.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1007/11555827_22openalex-snapshot
Soundness of Formal Encryption in the Presence of Key-Cycles
inferredcites →https://doi.org/10.1007/11681878_20openalex-snapshot
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
inferredcites →https://doi.org/10.1007/3-540-36492-7_6openalex-snapshot
Encryption-Scheme Security in the Presence of Key-Dependent Messages
inferredcites →https://doi.org/10.1007/3-540-38424-3_6openalex-snapshot
Fair Computation of General Functions in Presence of Immoral Majority
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-44929-9_1openalex-snapshot
Reconciling Two Views of Cryptography
inferredcites →https://doi.org/10.1007/3-540-44987-6_7openalex-snapshot
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
inferredcites →https://doi.org/10.1007/3-540-45309-1_6openalex-snapshot
Semantics and Program Analysis of Computationally Secure Information Flow
inferredcites →https://doi.org/10.1007/3-540-45500-0_4openalex-snapshot
Formal Eavesdropping and Its Computational Interpretation
inferredcites →https://doi.org/10.1007/3-540-46766-1_35openalex-snapshot
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
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/bf00196771openalex-snapshot
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
inferredcites →https://doi.org/10.1007/bfb0055718openalex-snapshot
Relations among notions of security for public-key encryption schemes
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.1007/s001459910006openalex-snapshot
Security and Composition of Multiparty Cryptographic Protocols
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
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/secpri.1989.36288openalex-snapshot
Using narrowing in the analysis of key management 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/secpri.2004.1301316openalex-snapshot
Symmetric encryption in automatic analyses for con .dentiality against active adversaries
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.1997.646128openalex-snapshot
A concrete security treatment of symmetric encryption
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/tdsc.2005.25openalex-snapshot
Relating Symbolic and Cryptographic Secrecy
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.1515/9780691206844openalex-snapshot
Pseudorandomness and Cryptographic Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11863908_26openalex-snapshot
Conditional Reactive Simulatability
inferred← citeshttps://doi.org/10.1007/11916277_22openalex-snapshot
Deciding Key Cycles for Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_9openalex-snapshot
Circular Security Is Complete for KDM Security
inferred← citeshttps://doi.org/10.1007/978-3-031-13191-2_5openalex-snapshot
A Hybrid Combinatorial-Boolean Approach Toward Perfect Secrecy in IoT
inferred← citeshttps://doi.org/10.1007/978-3-031-58734-4_10openalex-snapshot
Symmetric Signcryption and E2EE Group Messaging in Keybase
inferred← citeshttps://doi.org/10.1007/978-3-319-04852-9_24openalex-snapshot
KDM Security in the Hybrid Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_11openalex-snapshot
Completeness of Single-Bit Projection-KDM Security for Public Key Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_7openalex-snapshot
Towards Key-Dependent Message Security in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_31openalex-snapshot
OAEP Is Secure under Key-Dependent Messages
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_20openalex-snapshot
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_35openalex-snapshot
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03459-6_13openalex-snapshot
Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_4openalex-snapshot
On Symmetric Encryption and Point Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_13openalex-snapshot
Black-Box Circular-Secure Encryption beyond Affine Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_28openalex-snapshot
Efficient Circuit-Size Independent Public Key Encryption with KDM Security
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_29openalex-snapshot
Key-Dependent Message Security: Generic Amplification and Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-24316-5_21openalex-snapshot
Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing
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-36594-2_30openalex-snapshot
Computational Soundness of Coinductive Symbolic Security under Active Attacks
inferred← citeshttps://doi.org/10.1007/s00145-013-9149-6openalex-snapshot
Key-Dependent Message Security: Generic Amplification and Completeness
inferred← citeshttps://doi.org/10.1007/s10207-007-0046-6openalex-snapshot
Conditional reactive simulatability
inferred← citeshttps://doi.org/10.1007/s10623-011-9523-zopenalex-snapshot
Security of message authentication codes in the presence of key-dependent messages
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.1016/j.ic.2007.05.002openalex-snapshot
The reactive simulatability (RSIM) framework for asynchronous systems
inferred← citeshttps://doi.org/10.1109/csf.2009.18openalex-snapshot
Universally Composable Symmetric Encryption
inferred← citeshttps://doi.org/10.1109/csf.2009.7openalex-snapshot
A Secure Cryptographic Token Interface
inferred← citeshttps://doi.org/10.1145/1656242.1656244openalex-snapshot
Deciding security properties for cryptographic protocols. application to key cycles
inferred← citeshttps://doi.org/10.2478/v10127-010-0029-2openalex-snapshot
Security of signature schemes in the presence of key-dependent messages
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.