On the public citation graph
A Remark on Implementing the Weil Pairing
0 signed · 40 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/10722028_23openalex-snapshot
A One Round Protocol for Tripartite Diffie–Hellman
inferredcites →https://doi.org/10.1007/11586821_2openalex-snapshot
Pairing-Based Cryptography at High Security Levels
inferredcites →https://doi.org/10.1007/3-540-36288-6_2openalex-snapshot
An Identity-Based Signature from Gap Diffie-Hellman Groups
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-36563-x_24openalex-snapshot
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
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-44647-8_4openalex-snapshot
Self Protecting Pirates and Black-Box Traitor Tracing
inferredcites →https://doi.org/10.1007/3-540-44987-6_13openalex-snapshot
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-45450-0_28openalex-snapshot
A New Identification Scheme Based on the Bilinear Diffie-Hellman Problem
inferredcites →https://doi.org/10.1007/3-540-45455-1_26openalex-snapshot
Implementing the Tate Pairing
inferredcites →https://doi.org/10.1007/3-540-45455-1_3openalex-snapshot
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-45537-x_10openalex-snapshot
Polynomial Reconstruction Based Cryptography
inferredcites →https://doi.org/10.1007/3-540-45682-1_29openalex-snapshot
Supersingular Curves in Cryptography
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-45708-9_23openalex-snapshot
Efficient Algorithms for Pairing-Based Cryptosystems
inferredcites →https://doi.org/10.1007/978-1-4615-3198-2openalex-snapshot
Elliptic Curve Public Key Cryptosystems
inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/978-3-030-26951-7openalex-snapshot
Advances in Cryptology – CRYPTO 2019
inferredcites →https://doi.org/10.1007/978-3-030-92062-3openalex-snapshot
Advances in Cryptology – ASIACRYPT 2021
inferredcites →https://doi.org/10.1007/978-3-031-07085-3openalex-snapshot
Advances in Cryptology – EUROCRYPT 2022
inferredcites →https://doi.org/10.1007/978-3-540-24632-9_20openalex-snapshot
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-24847-7_12openalex-snapshot
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
inferredcites →https://doi.org/10.1007/978-3-662-54388-7openalex-snapshot
Public-Key Cryptography – PKC 2017
inferredcites →https://doi.org/10.1007/b95631openalex-snapshot
Public key cryptography - PKC 2004 : 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, March 1-4, 2004 : proceedings
inferredcites →https://doi.org/10.1007/s00145-004-0315-8openalex-snapshot
The Weil Pairing, and Its Efficient Calculation
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1049/el:20020682openalex-snapshot
ID-based signatures from pairingson elliptic curves
inferredcites →https://doi.org/10.1109/18.771254openalex-snapshot
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
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.1695openalex-snapshot
Identity‐based schemes for a secured big data and cloud ICT framework in smart grid system
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_26openalex-snapshot
Efficient Self-pairing on Ordinary Elliptic Curves
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417459openalex-snapshot
An Identity-Based Security Scheme for a Big Data Driven Cloud Computing Framework in Smart Grid
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417459openalex-snapshot
An Identity-Based Security Scheme for a Big Data Driven Cloud Computing Framework in Smart Grid
inferred← citeshttps://doi.org/10.1109/isvlsi.2011.39openalex-snapshot
Design and Analysis of Pairing Based Cryptographic Hardware for Prime Fields
inferred← citeshttps://doi.org/10.1109/tit.2012.2184850openalex-snapshot
Faster Computation of Self-Pairings
inferred← citeshttps://doi.org/10.12732/ijpam.v105i2.6openalex-snapshot
EFFICIENT SIGNATURE SCHEME FROM SELF-PAIRING ON ELLIPTIC CURVES
inferred← citeshttps://doi.org/10.1515/jmc-2012-0009openalex-snapshot
Self-pairings on hyperelliptic curves
inferred← citeshttps://doi.org/10.5755/j01.eie.26.1.25312openalex-snapshot
Storage and Communication Security in Cloud Computing Using a Homomorphic Encryption Scheme Based Weil Pairing
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.