The DOI matches its Crossref record.
Pairing-Friendly Elliptic Curves of Prime Order
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
Cited by
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
MIStore: a Blockchain-Based Medical Insurance Storage System
Zhou, L., Wang, L., & Sun, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0996-4 · Cited by 217
Parno (2016) · doi:10.1145/2856449 · Cited by 212
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
Froelicher, D., Troncoso-Pastoriza, J. R., Sousa, J. S., & Hubaux, J.-P. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2976612 · Cited by 59
Metadata
- Authors
- Barreto, P. S. L. M., & Naehrig, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 319-331
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1553083934
- Cited by
- 877
- References
- 0
- FWCI
- 26.93
- Type
- conference paper
- 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: Pairing-Friendly Elliptic Curves of Prime Order. https://app.cochat.ai/papers/10.1007/11693383_22
- The paper
- Barreto, P. S. L. M., & Naehrig, M. (2006). Pairing-Friendly Elliptic Curves of Prime Order. Lecture Notes in Computer Science. https://doi.org/10.1007/11693383_22
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.
