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
Cited by
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
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
A secure revocable fine-grained access control and data sharing scheme for SCADA in IIoT systems
Zhang, W., Zhang, H., Fang, L., Liu, Z., & Ge, C. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3091760 · Cited by 26
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. https://app.cochat.ai/papers/10.1007/11593447_28
- The paper
- Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J. (2005). Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. Lecture Notes in Computer Science. https://doi.org/10.1007/11593447_28
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.
