The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
ID-based signatures from pairingson elliptic curves
Abstract
An efficient identity-based signature scheme is presented which makes use of bilinear pairings on elliptic curves. This scheme is similar to the generalised ElGamal signature scheme. The security of the scheme is considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Supersingular Curves in Cryptography
Galbraith⋆, S. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_29 · Cited by 226
Cited by
Certificateless Public Key Cryptography
Al-Riyami, S. S., & Paterson, K. G. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_29 · Cited by 2,217
Self-citationAn Identity-Based Signature from Gap Diffie-Hellman Groups
Choon, J. C., & Hee Cheon, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_2 · Cited by 917
Efficient Identity Based Signature Schemes Based on Pairings
Hess, F. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_20 · Cited by 840
jPBC: Java pairing based cryptography
De Caro, A., & Iovino, V. (2011) · 2011 IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2011.5983948 · Cited by 703
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
Zhang, F., Safavi-Naini, R., & Susilo, W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24632-9_20 · Cited by 513
Metadata
- Authors
- Paterson, K. G.
- Venue
- Electronics Letters
- Published
- 2002-08-29
- Volume
- 38
- Issue
- 18
- Pages
- 1025-1026
- ISSN
- 0013-5194 (ISSN-L)
- 1350-911X
- OpenAlex
- W2015453719
- Cited by
- 366
- References
- 7
- FWCI
- 25.43
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.