The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Short Signatures from the Weil Pairing
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
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
Self-citationRandom oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Self-citationA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
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
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
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
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_21 · Cited by 545
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
Fast batch verification for modular exponentiation and digital signatures
Bellare, M., Garay, J. A., & Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054130 · Cited by 443
On the Exact Security of Full Domain Hash
Coron, J.-S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_14 · Cited by 347
Constructive and destructive facets of Weil descent on elliptic curves
Gaudry, P., Hess, F., & Smart, N. P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0011-x · Cited by 300
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
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
Supersingular Curves in Cryptography
Galbraith⋆, S. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_29 · Cited by 226
Optimal Security Proofs for PSS and Other Signature Schemes
Coron, J.-S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_18 · Cited by 215
Balasubramanian, R., & Koblitz, N. (1998) · Journal of Cryptology · doi:10.1007/s001459900040 · Cited by 202
QUARTZ, 128-Bit Long Digital Signatures: http://www.minrank.org/quartz/
Patarin, J., Courtois, N., & Goubin, L. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_21 · Cited by 167
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
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Nyberg, K., & Rueppel, R. A. (1996) · Designs Codes and Cryptography · doi:10.1007/bf00125076 · Cited by 153
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
Joux, A., & Nguyen, K. T. (2001) · Cited by 143
Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms
Maurer, U. M. (1994) · Cited by 133
Boldyreva, A. (2002) · Cited by 108
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
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
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
A Cryptographic Application of Weil Descent
Galbraith⋆, S. D., & Smart, N. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46665-7_23 · Cited by 80
On the Security of HFE, HFEv- and Quartz
Courtois, N. T., Daum, M., & Felke, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_25 · Cited by 64
Cited by
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
Self-citationIdentity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Self-citationGuide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Certificateless Public Key Cryptography
Al-Riyami, S. S., & Paterson, K. G. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_29 · Cited by 2,217
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
Self-citation
Metadata
- Authors
- Boneh, D., Lynn, B., & Shacham, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 514-532
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1610688607
- Cited by
- 2,993
- References
- 37
- FWCI
- 41.78
- 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.