On the public citation graph

HIBE With Short Public Parameters Without Random Oracle

0 signed · 57 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_26openalex-snapshot
Hierarchical Identity Based Encryption with Constant Size Ciphertext
inferredcites →https://doi.org/10.1007/11426639_7openalex-snapshot
Efficient Identity-Based Encryption Without Random Oracles
inferredcites →https://doi.org/10.1007/11523468_64openalex-snapshot
Boneh-Franklin Identity Based Encryption Revisited
inferredcites →https://doi.org/10.1007/11734727_33openalex-snapshot
Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model
inferredcites →https://doi.org/10.1007/3-540-36178-2_34openalex-snapshot
Hierarchical ID-Based Cryptography
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-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-45708-9_23openalex-snapshot
Efficient Algorithms for Pairing-Based Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-46035-7_31openalex-snapshot
Toward Hierarchical Identity-Based Encryption
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_13openalex-snapshot
Chosen-Ciphertext Security from Identity-Based Encryption
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-30574-3_8openalex-snapshot
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
inferredcites →https://doi.org/10.1007/s00145-004-0312-yopenalex-snapshot
A One Round Protocol for Tripartite Diffie–Hellman
inferredcites →https://doi.org/10.1137/s0097539701398521openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites →https://doi.org/10.1137/s009753970544713xopenalex-snapshot
Chosen‐Ciphertext Security from Identity‐Based Encryption

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-540-72540-4_14openalex-snapshot
Batch Verification of Short Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_4openalex-snapshot
Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_16openalex-snapshot
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-79263-5_13openalex-snapshot
Identity-Based Threshold Key-Insulated Encryption without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_13openalex-snapshot
Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
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-00730-9_1openalex-snapshot
Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-00862-7_21openalex-snapshot
Practical Short Signature Batch Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_24openalex-snapshot
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-21031-0_5openalex-snapshot
New Fully Secure Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-642-25243-3_4openalex-snapshot
A Variant of Boyen-Waters Anonymous IBE Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-34416-9_11openalex-snapshot
Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-55032-4_56openalex-snapshot
Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters
inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_5openalex-snapshot
Verifiable Random Functions from Weaker Assumptions
inferred← citeshttps://doi.org/10.1007/s00145-011-9108-zopenalex-snapshot
Batch Verification of Short Signatures
inferred← citeshttps://doi.org/10.1007/s11390-010-9366-5openalex-snapshot
New Constructions for Identity-Based Unidirectional Proxy Re-Encryption
inferred← citeshttps://doi.org/10.1016/j.csi.2014.12.004openalex-snapshot
Improved batch verification of signatures using generalized sparse exponents
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.041openalex-snapshot
An identity-based strongly unforgeable signature without random oracles from bilinear pairings
inferred← citeshttps://doi.org/10.1016/j.ins.2014.07.022openalex-snapshot
Security analysis of an identity-based strongly unforgeable signature scheme
inferred← citeshttps://doi.org/10.1016/j.jisa.2017.07.005openalex-snapshot
Analysis of hierarchical identity based encryption schemes and its applicability to computing environments
inferred← citeshttps://doi.org/10.1016/s1005-8885(08)60180-6openalex-snapshot
Identity-based encryption with wildcards in the standard model
inferred← citeshttps://doi.org/10.1093/comjnl/bxv050openalex-snapshot
Efficient and Fully CCA Secure Conditional Proxy Re-Encryption from Hierarchical Identity-Based Encryption
inferred← citeshttps://doi.org/10.1109/cis.2014.112openalex-snapshot
Hierarchial Identity-Based Encryption Scheme from Multilinear Maps
inferred← citeshttps://doi.org/10.1109/csf.2014.19openalex-snapshot
Certified Synthesis of Efficient Batch Verifiers
inferred← citeshttps://doi.org/10.1109/eidwt.2013.117openalex-snapshot
Constant Size Hierarchical Identity-Based Encryption Tightly Secure in the Full Model without Random Oracles
inferred← citeshttps://doi.org/10.1109/icc.2009.5198969openalex-snapshot
Efficient and Adaptively Secure Append-Only Signature
inferred← citeshttps://doi.org/10.1109/icitis.2010.5689516openalex-snapshot
Practical identity-based signature without random oracle
inferred← citeshttps://doi.org/10.1109/icnnsp.2008.4590384openalex-snapshot
Practical hierarchical identity based signature in the standard model
inferred← citeshttps://doi.org/10.1109/mvhi.2010.22openalex-snapshot
Cryptanalysis and Improvement of a HIBE and HIBS without Random Oracles
inferred← citeshttps://doi.org/10.1145/2382196.2382248openalex-snapshot
Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes
inferred← citeshttps://doi.org/10.1504/ijact.2013.053434openalex-snapshot
Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption
inferred← citeshttps://doi.org/10.1504/ijguc.2014.060182openalex-snapshot
Hierarchical identity-based encryption without key delegation in decryption
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1494openalex-snapshot
Practical Hierarchical Identity Based Encryption Scheme without Random Oracles
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1822openalex-snapshot
New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.1690openalex-snapshot
Further Analysis of a Practical Hierarchical Identity-Based Encryption Scheme
inferred← citeshttps://doi.org/10.3233/fi-2009-0013openalex-snapshot
New Construction of Short Hierarchical ID-Based Signature in the Standard Model
inferred← citeshttps://doi.org/10.3233/jcs-140507openalex-snapshot
Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes
inferred← citeshttps://doi.org/10.3390/e22111247openalex-snapshot
Adaptively Secure Efficient (H)IBE over Ideal Lattice with Short Parameters
inferred← citeshttps://doi.org/10.3390/sym11070913openalex-snapshot
Efficient Hierarchical Identity-Based Encryption System for Internet of Things Infrastructure
inferred← citeshttps://doi.org/10.4304/jnw.9.7.1846-1853openalex-snapshot
Unbounded Anonymous Hierarchical Identity-Based Encryption in the Standard Model
inferred← citeshttps://doi.org/10.6688/jise.2014.30.2.4openalex-snapshot
Constant Size Ciphertext and Private Key HIBE without Random Oracles
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.