The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Identity-based key agreement protocols 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
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
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
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
Self-citationCryptosystems based on pairing
Kasahara, M. (2000) · Medical Entomology and Zoology · Cited by 724
Key agreement protocols and their security analysis
Blake-Wilson⋆⋆, S., Johnson, D. B., & Menezes, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0024447 · Cited by 595
An Efficient Protocol for Authenticated Key Agreement
Law, L., Menezes, A., Qu, M., Solinas, J., & Vanstone, S. (2003) · Designs, Codes and Cryptography · doi:10.1023/a:1022595222606 · Cited by 513
Identity-based authenticated key agreement protocol based on Weil pairing
Smart, N. P. (2002) · Electronics Letters · doi:10.1049/el:20020387 · Cited by 446
Self-citationHess, F., Smart, N. P., & Vercauteren, F. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881709 · Cited by 443
Self-citationIdentity based authenticated key agreement protocols from pairings
Chen, L., & Kudla, C. (2004) · 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. · doi:10.1109/csfw.2003.1212715 · Cited by 288
Self-citationA New Two-Party Identity-Based Authenticated Key Agreement
McCullagh, N., & Barreto, P. S. L. M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_18 · Cited by 218
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052240 · Cited by 207
Modular Security Proofs for Key Agreement Protocols
Kudla, C., & Paterson, K. G. (2005) · Lecture notes in computer science · doi:10.1007/11593447_30 · Cited by 126
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
Self-citationAuthenticated ID-based Key Exchange and remote log-in with simple token and PIN number.Preprint
Scott, M. (2002) · IACR Cryptology ePrint Archive · Cited by 114
Efficient Identity-Based and Authenticated Key Agreement Protocol
Wang, Y. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35840-1_9 · Cited by 91
Key Agreement Using Statically Keyed Authenticators
Boyd, C., Mao, W., & Paterson, K. G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24852-1_18 · Cited by 90
On The Indistinguishability-Based Security Model of Key Agreement Protocols-Simple Cases.
Cheng, Z., Nistazakis, M., Comley, R., & Vasiu, L. (2005) · Cited by 86
Self-citationA New Efficient ID-Based Authenticated Key Agreement Protocol.Preprint
Yuan, Q., & Li, S. (2005) · IACR Cryptology ePrint Archive · Cited by 57
On Session Key Construction in Provably-Secure Key Establishment Protocols
Choo, K. R., Boyd, C., & Hitchcock, Y. (2005) · Lecture notes in computer science · doi:10.1007/11554868_9 · Cited by 42
On security proof of McCullagh Barreto's key agreement protocol and its variants
Cheng, Z., & Chen, L. (2007) · International Journal of Security and Networks · doi:10.1504/ijsn.2007.013178 · Cited by 34
Self-citationSpecial Signature Schemes and Key Agreement Protocols
Kudla, C. (2006) · Royal Holloway Digital Repository (Royal Holloway University of London) · Cited by 23
Cited by
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
Self-citationA 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
Context-Sensitive Access in Industrial Internet of Things (IIoT) Healthcare Applications
Al-Turjman, F., & Alturjman, S. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2808190 · Cited by 264
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server
Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., & Yanai, A. (2020) · 2020 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp48549.2020.00044 · Cited by 49
“The first assumption is the standard DDH-generalization groups with asymmetric pairings and has been used e.g. in [16].”
Method
Metadata
- Authors
- Chen, L., Cheng, Z., & Smart, N. P.
- Venue
- International Journal of Information Security
- Published
- 2007-01-11
- Volume
- 6
- Issue
- 4
- Pages
- 213-241
- ISSN
- 1615-5262 (ISSN-L)
- 1615-5270
- OpenAlex
- W2076965705
- Cited by
- 395
- References
- 26
- FWCI
- 37.82
- Type
- journal article
- 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.