The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An Identity-Based Signature from Gap Diffie-Hellman Groups
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. (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
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
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
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
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
Efficient Algorithms for Pairing-Based Cryptosystems
Barreto, P. S. L. M., Kim, H. Y., Lynn, B., & Scott, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_23 · Cited by 1,069
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Efficient 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
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
Efficient 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
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks
Zhang, C., Lu, R., Lin, X., Ho, P.-H., & Shen, X. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.58 · Cited by 667
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
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
Identity-Based Remote Data Integrity Checking With Perfect Data Privacy Preserving for Cloud Storage
Yu, Y., Au, M. H., Ateniese, G., Huang, X., Susilo, W., Dai, Y., & Min, G. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2615853 · Cited by 479
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
A survey on the adoption of blockchain in IoT: challenges and solutions
Uddin, M. A., Stranieri, A., Gondal, I., & Balasubramanian, V. (2021) · Blockchain: Research and Applications · doi:10.1016/j.bcra.2021.100006 · Cited by 365
A survey on peer-to-peer key management for mobile ad hoc networks
Merwe, J. V. D., Dawoud, D., & McDonald, S. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216371 · Cited by 343
A Survey of SIP Authentication and Key Agreement Schemes
Kilinc, H. H., & Yanik, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.091513.00050 · Cited by 312
Certificateless Remote Anonymous Authentication Schemes for WirelessBody Area Networks
Liu, J., Zhang, Z., Chen, X., & Kwak, K. S. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.145 · Cited by 299
A Privacy-Aware Authentication Scheme for Distributed Mobile Cloud Computing Services
Tsai, J.-L., & Lo, N.-W. (2015) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2322973 · Cited by 292
Secret handshakes from pairing-based key agreements
Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., & Wong, H.-C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199336 · Cited by 286
SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks
Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2020105 · Cited by 284
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
Lin, Q., Yan, H., Huang, Z., Chen, W., Shen, J., & Tang, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2809426 · Cited by 202
Metadata
- Authors
- Choon, J. C., & Hee Cheon, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002-12-18
- Pages
- 18-30
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2112914778
- Cited by
- 917
- References
- 18
- FWCI
- 37.52
- 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.