On the public citation graph

Security of an identity-based cryptosystem and the related reductions

https://doi.org/10.1007/bfb0054153
0 signed · 26 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/3-540-39568-7_5openalex-snapshot
Identity-Based Cryptosystems and Signature Schemes
inferredcites →https://doi.org/10.1007/3-540-46416-6_43openalex-snapshot
Non-interactive Public-Key Cryptography
inferredcites →https://doi.org/10.1007/3-540-47555-9_39openalex-snapshot
A Remark on a Non-interactive Public-Key Distribution System
inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/3-540-48285-7_4openalex-snapshot
A New Elliptic Curve Based Analogue of RSA
inferredcites →https://doi.org/10.1007/3-540-57220-1_86openalex-snapshot
Elliptic curves over F p suitable for cryptosystems
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/bfb0053428openalex-snapshot
Optimal asymmetric encryption
inferredcites →https://doi.org/10.1007/bfb0054116openalex-snapshot
Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
inferredcites →https://doi.org/10.1007/bfb0054135openalex-snapshot
A new public-key cryptosystem as secure as factoring
inferredcites →https://doi.org/10.1007/s001459900052openalex-snapshot
The Discrete Logarithm Problem on Elliptic Curves of Trace One
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot
Elliptic curves over finite fields and the computation of square roots mod 𝑝
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.2307/2007968openalex-snapshot
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11586821_26openalex-snapshot
Pairings on Elliptic Curves over Finite Commutative Rings
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_44openalex-snapshot
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-76620-1_10openalex-snapshot
Factoring n and the Number of Points of Kummer Hypersurfaces mod n
inferred← citeshttps://doi.org/10.1007/978-3-322-89817-3_18openalex-snapshot
Identitätbasierte Kryptosysteme als Alternative zu Public-Key-Infrastrukturen
inferred← citeshttps://doi.org/10.1007/978-3-642-33383-5_15openalex-snapshot
Additively Homomorphic Encryption with a Double Decryption Mechanism, Revisited
inferred← citeshttps://doi.org/10.1007/bfb0054012openalex-snapshot
Overview of elliptic curve cryptography
inferred← citeshttps://doi.org/10.1007/s00145-001-0015-6openalex-snapshot
Elliptic Curve Paillier Schemes
inferred← citeshttps://doi.org/10.1007/s00145-014-9192-yopenalex-snapshot
Breaking RSA May Be As Difficult As Factoring
inferred← citeshttps://doi.org/10.1007/s10623-009-9278-yopenalex-snapshot
On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups
inferred← citeshttps://doi.org/10.1007/s11139-023-00822-1openalex-snapshot
Factoring numbers with elliptic curves
inferred← citeshttps://doi.org/10.1109/tgcn.2022.3163596openalex-snapshot
An Efficient Identity-Based Aggregate Signcryption Scheme With Blockchain for IoT-Enabled Maritime Transportation System
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.