The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Efficient Algorithms for Pairing-Based Cryptosystems
Open accessOverview
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
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 Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
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
Self-citationA 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
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
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
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
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
Cryptosystems based on pairing
Kasahara, M. (2000) · Medical Entomology and Zoology · Cited by 724
Finite fields: Encyclopedia of mathematics and its applications
(1997) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(97)84597-x · Cited by 680
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Itoh, T., & Tsujii, S. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90024-7 · Cited by 634
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
Identity-based authenticated key agreement protocol based on Weil pairing
Smart, N. P. (2002) · Electronics Letters · doi:10.1049/el:20020387 · Cited by 446
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
Frey, G., Muller, M., & Ruck, H.-G. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771254 · Cited by 242
Fast Key Exchange with Elliptic Curve Systems
Schroeppel, R., Orman, H., O’Malley, S., & Spatscheck, O. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_4 · Cited by 231
Supersingular Curves in Cryptography
Galbraith⋆, S. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_29 · Cited by 226
Self-Blindable Credential Certificates from the Weil Pairing
Verheul, E. R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_31 · Cited by 164
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Verheul, E. R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_13 · Cited by 150
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
Joux, A., & Nguyen, K. T. (2001) · Cited by 143
Supersingular Abelian Varieties in Cryptology
Rubin, K., & Silverberg, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_22 · Cited by 103
Characterization of Elliptic Curve Traces Under FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45247-8_8 · Cited by 98
An elliptic curve implementation of the finite field digital signature algorithm
Koblitz, N. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055739 · Cited by 85
The implementation of elliptic curve cryptosystems
Menezes, A., & Vanstone, S. A. (2006) · Springer eBooks · doi:10.1007/bfb0030345 · Cited by 36
Cited by
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks
Sun, J., Zhang, C., Zhang, Y., & Fang, Y. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.14 · Cited by 364
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861382 · Cited by 329
Metadata
- Authors
- Barreto, P. S. L. M., Kim, H. Y., Lynn, B., & Scott, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Volume
- 2002
- Pages
- 354-369
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1637905077
- Cited by
- 1,069
- References
- 27
- FWCI
- 42.36
- Type
- conference paper
- 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.