The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Pairings for cryptographers
Open accessOverview
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
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
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 Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
Cryptosystems based on pairing
Kasahara, M. (2000) · Medical Entomology and Zoology · Cited by 724
Group signatures with verifier-local revocation
Boneh, D., & Shacham, H. (2004) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1030083.1030106 · Cited by 577
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Frey, G., & Ruck, H.-G. (1994) · Mathematics of Computation · doi:10.2307/2153546 · Cited by 551
A Taxonomy of Pairing-Friendly Elliptic Curves
Freeman, D., Scott, M., & Teske, E. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9048-z · Cited by 466
Hess, F., Smart, N. P., & Vercauteren, F. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881709 · Cited by 443
Self-citationEfficient pairing computation on supersingular Abelian varieties
Barreto, P. S. L. M., Galbraith⋆, S. D., hÉigeartaigh, C. Ó., et al. (2007) · Designs Codes and Cryptography · doi:10.1007/s10623-006-9033-6 · Cited by 434
Self-citationRecommendation for Key Management Part 1: General
Barker, E. (2016) · doi:10.6028/nist.sp.800-57pt1r4 · Cited by 396
Identity-based key agreement protocols from pairings
Chen, L., Cheng, Z., & Smart, N. P. (2007) · International Journal of Information Security · doi:10.1007/s10207-006-0011-9 · Cited by 395
Self-citationAdvances in Cryptology — EUROCRYPT 2003
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9 · Cited by 241
Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme
Chen, L., & Cheng, Z. (2005) · Lecture notes in computer science · doi:10.1007/11586821_29 · Cited by 122
Elliptic Curves with Low Embedding Degree
Luca, F., & Shparlinski, I. E. (2006) · Journal of Cryptology · doi:10.1007/s00145-006-0544-0 · Cited by 19
Cited by
On the Size of Pairing-Based Non-interactive Arguments
Groth, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_11 · Cited by 1,271
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Efficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
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
Attribute-Based Encryption With Verifiable Outsourced Decryption
Lai, J., Deng, R. H., Guan, C., & Weng, J. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2271848 · Cited by 466
Metadata
- Authors
- Galbraith, S. D., Paterson, K. G., & Smart, N. P.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 2008-09
- Volume
- 156
- Issue
- 16
- Pages
- 3113-3121
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W2026892462
- Cited by
- 794
- References
- 19
- FWCI
- 70.49
- Type
- journal article
- Language
- en
- Open access
- bronze
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.