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,320
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
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
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
Self-citationFactoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Introduction to Elliptic Curves and Modular Forms
Koblitz, N. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0909-6 · Cited by 964
Self-citationPairing-Friendly Elliptic Curves of Prime Order
Barreto, P. S. L. M., & Naehrig, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11693383_22 · Cited by 877
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Self-citationA Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
Self-citationThe Weil Pairing, and Its Efficient Calculation
Miller, V. S. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0315-8 · Cited by 578
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
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0312-y · Cited by 452
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Gordon, D. M. (1993) · SIAM Journal on Discrete Mathematics · doi:10.1137/0406010 · Cited by 322
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 297
Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups
Joux, A., & Nguyen, K. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0052-4 · Cited by 239
Breaking RSA may not be equivalent to factoring: Extended abstract
Boneh, D., & Venkatesan, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054117 · Cited by 235
Balasubramanian, R., & Koblitz, N. (1998) · Journal of Cryptology · doi:10.1007/s001459900040 · Cited by 202
Self-citationScott, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_20 · Cited by 180
Discrete logarithms and local units
Schirokauer, O. (1993) · Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences · doi:10.1098/rsta.1993.0139 · Cited by 145
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_1 · Cited by 141
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Verheul, E. R. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0313-x · Cited by 115
Unbelievable Security Matching AES Security Using Public Key Systems
Lenstra, A. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_5 · Cited by 113
Maurer, U. M., & Wolf, S. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008302122286 · Cited by 112
Discrete logarithms: The effectiveness of the index calculus method
Schirokauer, O., Weber, D., & Denny, T. F. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61581-4_66 · Cited by 103
Ordinary abelian varieties having small embedding degree
Galbraith⋆, S. D., McKee, J., & Valença, P. C. (2007) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2007.02.003 · Cited by 102
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
Function Field Sieve Method for Discrete Logarithms over Finite Fields
Adleman, L. M., & Huang, M.-D. A. (1999) · Information and Computation · doi:10.1006/inco.1998.2761 · Cited by 97
Joux, A., & Lercier, R. (2002) · Mathematics of Computation · doi:10.1090/s0025-5718-02-01482-5 · Cited by 93
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
Self-citationEfficient Pairing Computation on Supersingular Abelian Varieties.
Barreto, P. S. L. M., Galbraith⋆, S. D., O'hEigeartaigh, C., et al. (2004) · Cited by 83
Generating More MNT Elliptic Curves
Scott, M., & Barreto, P. S. L. M. (2006) · Designs Codes and Cryptography · doi:10.1007/s10623-005-0538-1 · Cited by 75
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
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
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_28 · Cited by 355
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
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
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.