The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Pairing-Friendly Elliptic Curves of Prime Order
Overview
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. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
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
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
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
Efficient Implementation of Pairing-Based Cryptosystems
Barreto, P. S. L. M., Lynn, B., & Scott, M. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0311-z · Cited by 155
Self-citationLenstra, A. K., & Verheul, E. R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_1 · Cited by 141
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
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
Self-citationBuilding Cyclic Elliptic Curves Modulo Large Primes
Morain, F. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_28 · Cited by 65
Ordinary abelian varieties having small embedding degree.
Galbraith⋆, S. D., McKee, J., & Valença, P. C. (2004) · Cited by 22
Cited by
Compact 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
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Quadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9129-2 · Cited by 511
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
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_28 · Cited by 437
Self-citationChosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2007) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
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
Signing a Linear Subspace: Signature Schemes for Network Coding
Boneh, D., Freeman, D., Katz, J., & Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_5 · Cited by 351
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Freeman, D. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_3 · Cited by 305
MIStore: a Blockchain-Based Medical Insurance Storage System
Zhou, L., Wang, L., & Sun, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0996-4 · Cited by 217
Parno (2016) · doi:10.1145/2856449 · Cited by 212
Ullah, S., Zheng, J., Din, N., Hussain, M. T., Ullah, F., & Yousaf, M. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2022.100530 · Cited by 195
Froelicher, D., Troncoso-Pastoriza, J. R., Sousa, J. S., & Hubaux, J.-P. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2976612 · Cited by 59
Metadata
- Authors
- Barreto, P. S. L. M., & Naehrig, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 319-331
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1553083934
- Cited by
- 877
- References
- 10
- FWCI
- 26.93
- 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.