The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
How to construct efficient signcryption schemes on elliptic curves
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“Shamir’s technique for fast computation of the product of multiple exponentials with the same modulo (see [3] as well as Algorithm 14.”
Method
Cited by
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
Ullah, S., Zheng, J., Din, N., Hussain, M. T., Ullah, F., & Yousaf, M. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2022.100530 · Cited by 195
Metadata
- Authors
- Zheng, Y., & Imai, H.
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 1998-12
- Volume
- 68
- Issue
- 5
- Pages
- 227-233
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W2113840257
- Cited by
- 236
- References
- 2
- FWCI
- 0.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: How to construct efficient signcryption schemes on elliptic curves. https://app.cochat.ai/papers/10.1016/s0020-0190(98)00167-7
- The paper
- Zheng, Y., & Imai, H. (1998). How to construct efficient signcryption schemes on elliptic curves. Information Processing Letters. https://doi.org/10.1016/s0020-0190(98)00167-7
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.