On the public citation graph

Efficient Identity-Based Encryption with Tight Security Reduction

0 signed · 45 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/11426639_7openalex-snapshot
Efficient Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/11496137_20openalex-snapshot
Identity Based Encryption Without Redundancy
inferredcites →https://doi.org/10.1007/11523468_64openalex-snapshot
Boneh-Franklin Identity Based Encryption Revisited
inferredcites →https://doi.org/10.1007/11599548_3openalex-snapshot
Improvements on Security Proofs of Some Identity Based Encryption Schemes
inferredcites →https://doi.org/10.1007/11761679_1openalex-snapshot
Security Analysis of the Strong Diffie-Hellman Problem
inferredcites →https://doi.org/10.1007/11761679_27openalex-snapshot
Practical Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/11780656_29openalex-snapshot
Generic Transforms to Acquire CCA-Security for Identity Based Encryption: The Cases of FOpkc and REACT
inferredcites →https://doi.org/10.1007/11818175_17openalex-snapshot
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
inferredcites →https://doi.org/10.1007/11935070_2openalex-snapshot
Efficient Identity-Based Encryption with Tight Security Reduction
inferredcites →https://doi.org/10.1007/3-540-39200-9_16openalex-snapshot
A Forward-Secure Public-Key Encryption Scheme
inferredcites →https://doi.org/10.1007/3-540-39568-7_5openalex-snapshot
Identity-Based Cryptosystems and Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-44586-2_8openalex-snapshot
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
inferredcites →https://doi.org/10.1007/3-540-44647-8_13openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites →https://doi.org/10.1007/3-540-45682-1_30openalex-snapshot
Short Signatures from the Weil Pairing
inferredcites →https://doi.org/10.1007/3-540-48405-1_34openalex-snapshot
Secure Integration of Asymmetric and Symmetric Encryption Schemes
inferredcites →https://doi.org/10.1007/3-540-49162-7_5openalex-snapshot
How to Enhance the Security of Public-Key Encryption at Minimum Cost
inferredcites →https://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferredcites →https://doi.org/10.1007/978-3-540-24660-2_23openalex-snapshot
A Parallelizable Enciphering Mode
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_14openalex-snapshot
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/978-3-540-28628-8_27openalex-snapshot
Secure Identity Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_28openalex-snapshot
A Tweakable Enciphering Mode
inferredcites →https://doi.org/10.1007/s001450010003openalex-snapshot
Security Arguments for Digital Signatures and Blind Signatures
inferredcites →https://doi.org/10.1137/s0097539701398521openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites →https://doi.org/10.1145/948109.948132openalex-snapshot
Efficiency improvements for signature schemes with tight security reductions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11761679_27openalex-snapshot
Practical Identity-Based Encryption Without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-030-42921-8_23openalex-snapshot
Certificateless Identity-Concealed Authenticated Encryption Under Multi-KGC
inferred← citeshttps://doi.org/10.1007/978-3-319-21966-0_13openalex-snapshot
New Security Proof for the Boneh-Boyen IBE: Tight Reduction in Unbounded Multi-challenge Security
inferred← citeshttps://doi.org/10.1007/978-3-319-61273-7_3openalex-snapshot
Another Look at Tightness II: Practical Issues in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_15openalex-snapshot
Removing Escrow from Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-21031-0_4openalex-snapshot
Generic Methods to Achieve Tighter Security Reductions for a Category of IBE Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_5openalex-snapshot
Waters Signatures with Optimal Security Reduction
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_22openalex-snapshot
A Framework for Identity-Based Encryption with Almost Tight Security
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_25openalex-snapshot
Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction
inferred← citeshttps://doi.org/10.1007/s10623-008-9218-2openalex-snapshot
A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
inferred← citeshttps://doi.org/10.1007/s10623-015-0035-0openalex-snapshot
An efficient IBE scheme with tight security reduction in the random oracle model
inferred← citeshttps://doi.org/10.1007/s10623-020-00794-zopenalex-snapshot
Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
inferred← citeshttps://doi.org/10.1016/j.ins.2015.07.011openalex-snapshot
New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie–Hellman problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.020openalex-snapshot
A strong provably secure IBE scheme without bilinear map
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.9.1803openalex-snapshot
Efficient Identity-Based Encryption with Tight Security Reduction
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.5.1241openalex-snapshot
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
inferred← citeshttps://doi.org/10.1109/mines.2009.171openalex-snapshot
An Improved Identity-Based Encryption Scheme Without Bilinear Map
inferred← citeshttps://doi.org/10.1155/2021/5519721openalex-snapshot
Anonymous Multireceiver Identity-Based Encryption against Chosen-Ciphertext Attacks with Tight Reduction in the Standard Model
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.1882openalex-snapshot
New Security Proof for the Boneh-Boyen IBE: Tight Reduction in Unbounded Multi-Challenge Security
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.720openalex-snapshot
A Variant of Park-Lee Identity-Based Encryption System
showing the first 20 of 21 · page through all 21
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.