On the public citation graph
Analysis of Key Wrapping APIs: Generic Policies, Computational Security
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/978-3-540-45238-6_32openalex-snapshot
On the Security of PKCS #11
inferredcites →https://doi.org/10.1007/978-3-642-04444-1_37openalex-snapshot
A Generic Security API for Symmetric Key Management on Cryptographic Devices
inferredcites →https://doi.org/10.1007/978-3-642-30057-8_32openalex-snapshot
New Definitions and Separations for Circular Security
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_36openalex-snapshot
Efficient Padding Oracle Attacks on Cryptographic Hardware
inferredcites →https://doi.org/10.1007/978-3-642-40203-6_19openalex-snapshot
Universally Composable Key-Management
inferredcites →https://doi.org/10.1007/978-3-662-46666-7_12openalex-snapshot
Automated Backward Analysis of PKCS#11 v2.20
inferredcites →https://doi.org/10.1109/csf.2009.7openalex-snapshot
A Secure Cryptographic Token Interface
inferredcites →https://doi.org/10.1109/csf.2011.25openalex-snapshot
Security for Key Management Interfaces
inferredcites →https://doi.org/10.1109/csf.2013.14openalex-snapshot
Type-Based Analysis of Generic Key Management APIs
inferredcites →https://doi.org/10.1109/csf.2016.27openalex-snapshot
Analysis of Key Wrapping APIs: Generic Policies, Computational Security
inferredcites →https://doi.org/10.1145/1866307.1866337openalex-snapshot
Attacking and fixing PKCS#11 security tokens
inferredcites →https://doi.org/10.1145/2660267.2660276openalex-snapshot
A Computationally Complete Symbolic Attacker for Equivalence Properties
inferredcites →https://doi.org/10.1145/3343508openalex-snapshot
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
inferredcites →https://doi.org/10.1145/586110.586125openalex-snapshot
Authenticated-encryption with associated-data
inferredcites →https://doi.org/10.1145/586123.586125openalex-snapshot
Authenticated-encryption with associated-data
inferredcites →https://doi.org/10.3233/jcs-130479openalex-snapshot
Type-based analysis of key management in PKCS#11 cryptographic devices
inferredcites →https://doi.org/10.3233/jcs-2009-0394openalex-snapshot
Formal security analysis of PKCS#11 and proprietary extensions
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-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-319-50011-9_33openalex-snapshot
Automated Security Proof of Cryptographic Support Commands in TPM 2.0
inferred← citeshttps://doi.org/10.1007/978-3-319-70972-7openalex-snapshot
The Security of NTP's Datagram Protocol.
inferred← citeshttps://doi.org/10.1007/978-3-319-70972-7_8openalex-snapshot
A Provably Secure PKCS#11 Configuration Without Authenticated Attributes
inferred← citeshttps://doi.org/10.1007/978-3-319-98989-1_18openalex-snapshot
Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker
inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_11openalex-snapshot
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case
inferred← citeshttps://doi.org/10.1109/csf.2017.33openalex-snapshot
Run-Time Attack Detection in Cryptographic APIs
inferred← citeshttps://doi.org/10.1109/csf.2017.9openalex-snapshot
Formal Computational Unlinkability Proofs of RFID Protocols
inferred← citeshttps://doi.org/10.1109/csf.2019.00011openalex-snapshot
Decidability of a Sound Set of Inference Rules for Computational Indistinguishability
inferred← citeshttps://doi.org/10.1109/csf.2019.00012openalex-snapshot
How to Wrap it up - A Formally Verified Proposal for the use of Authenticated Wrapping in PKCS#11
inferred← citeshttps://doi.org/10.1109/sp40001.2021.00078openalex-snapshot
An Interactive Prover for Protocol Verification in the Computational Model
inferred← citeshttps://doi.org/10.1109/sp46214.2022.9833800openalex-snapshot
A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols
inferred← citeshttps://doi.org/10.1145/3343508openalex-snapshot
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
inferred← citeshttps://doi.org/10.1145/3423169openalex-snapshot
Decidability of a Sound Set of Inference Rules for Computational Indistinguishability
inferred← citeshttps://doi.org/10.1155/2021/1864514openalex-snapshot
Threshold Key Management Scheme for Blockchain-Based Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.32469/10355/79561openalex-snapshot
Machine-aided analysis of vote privacy using computationally complete symbolic attacker
inferred← citeshttps://doi.org/10.70675/d68c77d4z020dz405ez86adz4690cf53b268openalex-snapshot
Preuves de protocoles cryptographiques : méthodes symboliques et attaquants puissants
inferred← citeshttps://doi.org/10.70675/feebd9afz70e2z4223zafaaz80a51eb47a29openalex-snapshot
Preuves symboliques de propriétés d’indistinguabilité calculatoire
showing the first 18 of 19 · page through all 19
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.