The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
ID-Based Blind Signature and Ring Signature from Pairings
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
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
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
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
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
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
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
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
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53018-4 · Cited by 795
(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 789
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
Cryptosystems based on pairing
Kasahara, M. (2000) · Medical Entomology and Zoology · Cited by 724
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Frey, G., & Ruck, H.-G. (1994) · Mathematics of Computation · doi:10.2307/2153546 · Cited by 551
A Generalized Birthday Problem
Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_19 · Cited by 539
Horadam, K. (2003) · Lecture notes in computer science · doi:10.1007/b93924 · Cited by 524
Identity-based authenticated key agreement protocol based on Weil pairing
Smart, N. P. (2002) · Electronics Letters · doi:10.1049/el:20020387 · Cited by 446
1-out-of-n Signatures from a Variety of Keys
Abe, M., Ohkubo, M., & Suzuki, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_26 · Cited by 337
Provably Secure Partially Blind Signatures
Abe, M., & Okamoto, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_17 · Cited by 245
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
Joux, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45455-1_3 · Cited by 232
Security of blind digital signatures: Extended abstract
Juels, A., Luby, M., & Ostrovsky, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052233 · Cited by 203
An ID-based cryptosystem based on the discrete logarithm problem
Tsujii, S., & Itoh, T. (1989) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.17709 · Cited by 190
Naor, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_31 · Cited by 164
Kim, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45861-1 · Cited by 150
Self-citationA New Identification Scheme Based on the Bilinear Diffie-Hellman Problem
Kim, M., & Kim, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45450-0_28 · Cited by 25
Self-citationAdvances in Cryptology – CRYPTO 2023
Handschuh, H., & Lysyanskaya, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38545-2 · Cited by 20
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
Aggregate 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
MedBlock: Efficient and Secure Medical Data Sharing Via Blockchain
Fan, K., Wang, S., Ren, Y., Li, H., & Yang, Y. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-0993-7 · Cited by 631
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
Self-citationAccumulators from Bilinear Pairings and Applications
Nguyen, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_19 · Cited by 431
Metadata
- Authors
- Zhang, F., & Kim, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 533-547
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1608511627
- Cited by
- 530
- References
- 32
- FWCI
- 19.84
- 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.