Dynamic ID-based remote user password authentication schemes using smart cards: A review
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Remote user authentication is a mechanism, in which the remote server verifies the legitimacy of a user over an insecure communication channel. Until now, there have been ample of remote user authentication schemes published in the literature and each published scheme has its own merits and demerits. A common feature among most of the published schemes is that the user's identity (ID) is static in all the transaction sessions, which may leak some information about that user and can create risk of identity theft during the message transmission. To overcome this risk, many researchers have proposed dynamic ID based remote user authentication schemes. In this paper, we have defined all the security requirements and all the goals an ideal password authentication scheme should satisfy and achieve. We have presented the results of our survey through six of the currently available dynamic ID based remote user authentication schemes. All the schemes are vulnerable to guessing attack except Khan et al.'s scheme, and do not meet the goals such as session key agreement, secret key forward secrecy. In the future, we hope an ideal dynamic ID based password authentication scheme, which meets all the security requirements and achieves all the goals can be developed.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Cited by
Two birds with one stone: two-factor authentication with security beyond conventional bound
Wang, D., & Wang, P. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2605087 · Cited by 539
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment
Wang, D., He, D., Wang, P., & Chu, C.-H. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2014.2355850 · Cited by 451
Wang, D., Li, W., & Wang, P. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2834351 · Cited by 272
“in [87], all this makes it vague and hardly workable to assess a scheme; the criteria set in [88] takes no consideration of the important “usability-security tension” (see Section V-A), for it”
BackgroundQiu, S., Wang, D., Xu, G., & Kumari, S. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3022797 · Cited by 224
Wang, D., & Wang, P. (2014) · Ad Hoc Networks · doi:10.1016/j.adhoc.2014.03.003 · Cited by 162
“nique are the so-called ‘‘dynamic-ID’’ schemes [46,47], and Fan et al.”
Metadata
- Authors
- Madhusudhan, R., & Mittal, R. C.
- Venue
- Journal of Network and Computer Applications
- Publisher
- Elsevier BV
- Published
- 2012-07
- Volume
- 35
- Issue
- 4
- Pages
- 1235-1248
- ISSN
- 1084-8045 (ISSN-L)
- OpenAlex
- W2022945883
- Cited by
- 154
- References
- 2
- FWCI
- 19.84
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic ID-based remote user password authentication schemes using smart cards: A review. https://app.cochat.ai/papers/10.1016/j.jnca.2012.01.007
- The paper
- Madhusudhan, R., & Mittal, R. C. (2012). Dynamic ID-based remote user password authentication schemes using smart cards: A review. Journal of Network and Computer Applications. https://doi.org/10.1016/j.jnca.2012.01.007
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.