The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Pairing-Based Cryptography at High Security Levels
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
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
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
Lide, R., & Niederreiter, H. (1996) · Cited by 2,213
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
Cited by
Efficient and robust pseudonymous authentication in VANET
Calandriello, G., Papadimitratos, P., Hubaux, J.-P., & Lioy, A. (2007) · Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks · doi:10.1145/1287748.1287752 · Cited by 543
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Towards Smart Healthcare: Patient Data Privacy and Security in Sensor‐Cloud Infrastructure
Masood, I., Wang, Y., Daud, A., Aljohani, N. R., & Dawood, H. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/2143897 · Cited by 78
Efficient, Compromise Resilient and Append-Only Cryptographic Schemes for Secure Audit Logging
Yavuz, A. A., Ning, P., & Reiter, M. K. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_12 · Cited by 53
Metadata
- Authors
- Koblitz, N., & Menezes, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 13-36
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2117596926
- Cited by
- 317
- References
- 41
- FWCI
- 19.32
- 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-Based Cryptography at High Security Levels. https://app.cochat.ai/papers/10.1007/11586821_2
- The paper
- Koblitz, N., & Menezes, A. (2005). Pairing-Based Cryptography at High Security Levels. Lecture Notes in Computer Science. https://doi.org/10.1007/11586821_2
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.
