The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment
Abstract
Despite two decades of intensive research, it remains a challenge to design a practical anonymous two-factor authentication scheme, for the designers are confronted with an impressive list of security requirements (e.g., resistance to smart card loss attack) and desirable attributes (e.g., local password update). Numerous solutions have been proposed, yet most of them are shortly found either unable to satisfy some critical security requirements or short of a few important features. To overcome this unsatisfactory situation, researchers often work around it in hopes of a new proposal (but no one has succeeded so far), while paying little attention to the fundamental question: whether or not there are inherent limitations that prevent us from designing an “ideal” scheme that satisfies all the desirable goals? In this work, we aim to provide a definite answer to this question. We first revisit two foremost proposals, i.e. Tsai et al.'s scheme and Li's scheme, revealing some subtleties and challenges in designing such schemes. Then, we systematically explore the inherent conflicts and unavoidable trade-offs among the design criteria. Our results indicate that, under the current widely accepted adversarial model, certain goals are beyond attainment. This also suggests a negative answer to the open problem left by Huang et al. in 2014. To the best of knowledge, the present study makes the first step towards understanding the underlying evaluation metric for anonymous two-factor authentication, which we believe will facilitate better design of anonymous two-factor protocols that offer acceptable trade-offs among usability, security and privacy.
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
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
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
Chaum, D., & van Heyst, E. (1991) · Theory and Application of Cryptographic Techniques · Cited by 1,492
The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords
Bonneau, J. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.49 · Cited by 687
Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures
Barenghi, A., Breveglieri, L., Koren, I., & Naccache, D. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188769 · Cited by 609
Maji, H. K., Prabhakaran, M., & Rosulek, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_24 · Cited by 437
A dynamic ID-based remote user authentication scheme
Das, M. L., Saxena, A., & Gulati, V. P. (2004) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2004.1309441 · Cited by 434
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
An improved smart card based password authentication scheme with provable security
Xu, J., Zhu, W.-T., & Feng, D.-G. (2009) · Computer Standards & Interfaces · doi:10.1016/j.csi.2008.09.006 · Cited by 373
Password authentication schemes with smart cards
Yang, W.-H., & Shieh, S.-P. (1999) · Computers & Security · doi:10.1016/s0167-4048(99)80136-9 · Cited by 305
A more efficient and secure dynamic ID-based remote user authentication scheme
Wang, Y.-Y., Liu, J.-Y., Xiao, F.-X., & Dan, J. (2009) · Computer Communications · doi:10.1016/j.comcom.2008.11.008 · Cited by 301
A password authentication scheme over insecure networks
Liao, I.-E., Lee, C.-C., & Hwang, M.-S. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.10.001 · Cited by 267
An enhanced smart card based remote user password authentication scheme
Li, X., Niu, J., Khurram Khan, M., & Liao, J. (2013) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2013.02.034 · Cited by 256
Huang, X., Xiang, Y., Chonka, A., Zhou, J., & Deng, R. H. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.206 · Cited by 237
Khan, M. K., Kim, S.-K., & Alghathbar, K. (2011) · Computer Communications · doi:10.1016/j.comcom.2010.02.011 · Cited by 225
Reverse-engineering a cryptographic RFID tag
Nohl, K., Evans, D., Starbug, S., & Plötz, H. (2008) · Cited by 225
Another Look at "Provable Security"
Koblitz, N., & Menezes, A. J. (2007) · Journal of Cryptology · doi:10.1007/s00145-005-0432-z · Cited by 218
Wang, D., & Wang, P. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.07.010 · Cited by 205
Self-citationTwo-factor mutual authentication based on smart cards and passwords
Yang, G., Wong, D. S., Wang, H., & Deng, X. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2008.04.002 · Cited by 195
Gunson, N., Marshall, D., Morton, H., & Jack, M. (2011) · Computers & Security · doi:10.1016/j.cose.2010.12.001 · Cited by 188
Security flaws in two improved remote user authentication schemes using smart cards
Ma, C., Wang, D., & Zhao, S. (2014) · International Journal of Communication Systems · doi:10.1002/dac.2468 · Cited by 167
Self-citationXue, K., Hong, P., & Ma, C. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.07.004 · Cited by 160
Dynamic ID-based remote user password authentication schemes using smart cards: A review
Madhusudhan, R., & Mittal, R. C. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.01.007 · Cited by 153
Robust Multi-Factor Authentication for Fragile Communications
Huang, X., Xiang, Y., Bertino, E., Zhou, J., & Xu, L. (2014) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2013.2297110 · Cited by 147
Password Authentication Schemes: Current Status and Key Issues
Tsai, C., Lee, C., & Hwang, M. (2006) · doi:10.6633/ijns.200609.3(2).01 · Cited by 145
Anonymity Enhancement on Robust and Efficient Password-Authenticated Key Agreement Using Smart Cards
Li, X., Qiu, W., Zheng, D., Chen, K., & Li, J. (2009) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2009.2028351 · Cited by 115
Kumari, S., & Khan, M. K. (2013) · International Journal of Communication Systems · doi:10.1002/dac.2590 · Cited by 101
Offline Dictionary Attack on Password Authentication Schemes Using Smart Cards
Wang, D., & Wang, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-27659-5_16 · Cited by 93
Self-citationEfficient and secure authenticated key exchange using weak passwords
Katz, J. I., Ostrovsky, R., & Yung, M. M. (2009) · Journal of the ACM · doi:10.1145/1613676.1613679 · Cited by 88
Novel Anonymous Authentication Scheme Using Smart Cards
Tsai, J., Lo, N., & Wu, T. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2230639 · Cited by 88
Further Observations on Smart-Card-Based Password-Authenticated Key Agreement in Distributed Systems
Huang, X., Chen, X., Li, J., Xiang, Y., & Xu, L. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.230 · Cited by 86
Li, C. (2013) · IET Information Security · doi:10.1049/iet-ifs.2012.0058 · Cited by 85
Robust authentication and key agreement scheme preserving the privacy of secret key
Wang, R.-C., Juang, W.-S., & Lei, C. (2010) · Computer Communications · doi:10.1016/j.comcom.2010.04.005 · Cited by 81
Robust smart‐cards‐based user authentication scheme with user anonymity
Wu, S., Zhu, Y., & Pu, Q. (2011) · Security and Communication Networks · doi:10.1002/sec.315 · Cited by 71
Password Protected Smart Card and Memory Stick Authentication against Off-Line Dictionary Attacks
Wang, Y. (2012) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-3-642-30436-1_40 · Cited by 66
Two robust remote user authentication protocols using smart cards
Yeh, K., Su, C., Lo, N., Li, Y., & Hung, Y.-X. (2010) · Journal of Systems and Software · doi:10.1016/j.jss.2010.07.062 · Cited by 65
Security Analysis of a Single Sign-On Mechanism for Distributed Computer Networks
Wang, G., Yu, J., & Xie, Q. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2215877 · Cited by 60
Another Look at Provable Security
Menezes, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_2 · Cited by 57
More secure smart card‐based remote user password authentication scheme with user anonymity
Kumari, S., & Khan, M. K. (2013) · Security and Communication Networks · doi:10.1002/sec.916 · Cited by 55
Security Analysis of a Nonce-Based User Authentication Scheme Using Smart Cards
Nam, J., Kim, S., Park, S., & Won, D. (2007) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e90-a.1.299 · Cited by 30
Understanding identity exposure in pervasive computing environments
Zhu, F. W., Carpenter, S., & Kulkarni, A. (2011) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.06.007 · Cited by 28
An Efficient Threshold Anonymous Authentication Scheme for Privacy-Preserving Communications
Ren, J., & Harn, L. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.12.112120 · Cited by 27
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
Self-citationSurvey on Collaborative Smart Drones and Internet of Things for Improving Smartness of Smart Cities
Alsamhi, S. H., Ma, O., Ansari, M. S., & Almalki, F. A. (2019) · IEEE Access · doi:10.1109/access.2019.2934998 · Cited by 440
Multi-Factor Authentication: A Survey
Ometov, A., Bezzateev, S., Mäkitalo, N., Andreev, S., Mikkonen, T., & Koucheryavy, Y. (2018) · Cryptography · doi:10.3390/cryptography2010001 · Cited by 434
A Secure Biometrics-Based Multi-Server Authentication Protocol Using Smart Cards
Odelu, V., Das, A. K., & Goswami, A. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2439964 · Cited by 413
Li, X., Niu, J., Kumari, S., Wu, F., Sangaiah, A. K., & Choo, K.-K. R. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.07.001 · Cited by 351
Metadata
- Authors
- Wang, D., He, D., Wang, P., & Chu, C.-H.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2015-07-01
- Volume
- 12
- Issue
- 4
- Pages
- 428-442
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W1967308747
- Cited by
- 451
- References
- 44
- FWCI
- 47.39
- 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.