The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
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
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
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Random 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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
A 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
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,643
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Zheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
Hierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
An Identity-Based Signature from Gap Diffie-Hellman Groups
Choon, J. C., & Hee Cheon, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_2 · Cited by 917
Pairing-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
Self-citationEfficient 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
Secure Identity Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_27 · Cited by 621
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
Zhang, F., Safavi-Naini, R., & Susilo, W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24632-9_20 · Cited by 513
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 “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
Guillou, L. C., & Quisquater, J.-J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_16 · Cited by 451
Self-citationMultipurpose identity-based signcryption: A swiss army knife for identity-based cryptography
Boyen, X. (2003) · QUT ePrints (Queensland University of Technology) · Cited by 324
Improved Identity-Based Signcryption
Chen, L., & Malone-Lee, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30580-4_25 · Cited by 299
Strong Key-Insulated Signature Schemes
Dodis, Y., Katz, J., Xu, S., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_10 · Cited by 250
Multipurpose Identity-Based Signcryption
Boyen, X. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_23 · Cited by 244
Chow, S. S. M., Yiu, S., Hui, L. C. K., & Chow, K. P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24691-6_26 · Cited by 201
Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme
Chen, L., & Cheng, Z. (2005) · Lecture notes in computer science · doi:10.1007/11586821_29 · Cited by 122
A New ID-based Signature with Batch Verification.Preprint
Cheon, J. H., Kim, Y., & Yoon, H. (2004) · IACR Cryptology ePrint Archive · Cited by 69
Cited by
GSIS: A Secure and Privacy-Preserving Protocol for Vehicular Communications
Lin, X., Sun, X., Ho, P.-H., & Shen, X. (2007) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2007.906878 · Cited by 917
A Security and Privacy Review of VANETs
Qu, F., Wu, Z., Wang, F., & Cho, W. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2439292 · Cited by 478
Provably Secure Authenticated Key Agreement Scheme for Smart Grid
Odelu, V., Das, A. K., Wazid, M., & Conti, M. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2602282 · Cited by 355
Security in vehicular ad hoc networks
Lin, X., Lu, R., Zhang, C., Zhu, H., Ho, P.-H., & Shen, X. (2008) · IEEE Communications Magazine · doi:10.1109/mcom.2008.4481346 · Cited by 342
Secure Anonymous Key Distribution Scheme for Smart Grid
Tsai, J.-L., & Lo, N.-W. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2440658 · Cited by 306
Metadata
- Authors
- Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 515-532
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1832688593
- Cited by
- 437
- References
- 30
- FWCI
- 13.36
- 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.