The DOI matches its Crossref record; 16 of the 16 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
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-citationThe 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
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
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
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
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
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
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
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
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-citationAggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Self-citationCompact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
Self-citationPrivacy-Preserving Public Auditing for Secure Cloud Storage
Wang, C., Chow, S. S. M., Wang, Q., Ren, K., & Lou, W. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.245 · Cited by 1,374
Metadata
- Authors
- Boneh, D., Lynn, B., & Shacham, H.
- Venue
- Journal of Cryptology
- Published
- 2004-07-30
- Volume
- 17
- Issue
- 4
- Pages
- 297-319
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2014239329
- Cited by
- 1,467
- References
- 16
- FWCI
- 44.40
- 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.