On the public citation graph
A Robust Verifiably Encrypted Signature Scheme
0 signed · 28 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/11599548_4openalex-snapshot
An ID-Based Verifiable Encrypted Signature Scheme Based on Hess’s Scheme
inferredcites →https://doi.org/10.1007/11604655_41openalex-snapshot
Verifiably Encrypted Signature Scheme Without Random Oracles
inferredcites →https://doi.org/10.1007/3-540-36492-7_20openalex-snapshot
Efficient Identity Based Signature Schemes Based on Pairings
inferredcites →https://doi.org/10.1007/3-540-39200-9_26openalex-snapshot
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
inferredcites →https://doi.org/10.1007/3-540-44647-8_4openalex-snapshot
Self Protecting Pirates and Black-Box Traitor Tracing
inferredcites →https://doi.org/10.1007/978-3-319-72344-0openalex-snapshot
Distributed Computing and Internet Technology
inferredcites →https://doi.org/10.1007/978-3-540-24582-7_14openalex-snapshot
Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_8openalex-snapshot
Practical Verifiable Encryption and Decryption of Discrete Logarithms
inferredcites →https://doi.org/10.1007/b11817openalex-snapshot
Advances in cryptology - CRYPTO 2003 : 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003 : proceedings
inferredcites →https://doi.org/10.1007/b94593openalex-snapshot
Progress in Cryptology - INDOCRYPT 2003
inferredcites →https://doi.org/10.1007/bfb0054112openalex-snapshot
Advances in cryptology-EUROCRYPT '98 : International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31-June 4, 1998 : proceedings
inferredcites →https://doi.org/10.1007/bfb0054156openalex-snapshot
Optimistic fair exchange of digital signatures
inferredcites →https://doi.org/10.1007/s001450010003openalex-snapshot
Security Arguments for Digital Signatures and Blind Signatures
inferredcites →https://doi.org/10.1109/secpri.1998.674825openalex-snapshot
Efficient and practical fair exchange protocols with off-line TTP
inferredcites →https://doi.org/10.1145/319709.319728openalex-snapshot
Efficient verifiable encryption (and fair exchange) of digital signatures
inferredcites →https://doi.org/10.1145/984334.984335openalex-snapshot
Verifiable encryption of digital signatures and applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.652openalex-snapshot
Identity‐based optimistic fair exchange in the standard model
inferred← citeshttps://doi.org/10.1007/978-3-540-72163-5_7openalex-snapshot
A Novel Verifiably Encrypted Signature Scheme Without Random Oracle
inferred← citeshttps://doi.org/10.1007/978-3-540-72163-5_9openalex-snapshot
An Efficient ID-Based Verifiably Encrypted Signature Scheme Based on Hess’s Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-04642-1_8openalex-snapshot
Identity-Based Verifiably Encrypted Signatures without Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-22450-8_13openalex-snapshot
Efficient CDH-Based Verifiably Encrypted Signatures with Optimal Bandwidth in the Standard Model
inferred← citeshttps://doi.org/10.1109/cisce58541.2023.10142628openalex-snapshot
Fair Contract Signing Model Based on Blockchain and VES Algorithm
inferred← citeshttps://doi.org/10.1109/csnt.2012.114openalex-snapshot
A New Efficient ID-Based Verifiably Encrypted Signature Scheme
inferred← citeshttps://doi.org/10.1109/ias.2009.190openalex-snapshot
On Security Notions for Verifiably Encrypted Signature
inferred← citeshttps://doi.org/10.1109/icicta.2011.548openalex-snapshot
An Efficient Verifiably Encrypted Signature Scheme Based on Half-Trust Private Key Generator
inferred← citeshttps://doi.org/10.1109/icnidc.2010.5657887openalex-snapshot
Certificateless verifiably encrypted signature scheme
inferred← citeshttps://doi.org/10.1504/ijcnds.2014.064636openalex-snapshot
Efficient certificate-based verifiable encrypted signature scheme
inferred← citeshttps://doi.org/10.2174/1874110x01408010239openalex-snapshot
An Efficient Certificate-based Verifiable Encrypted Signature Scheme Without Pairings
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.