The Request for Better Measurement: A Comparative Evaluation of Two-Factor Authentication Schemes
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Despite over two decades of continuous efforts, how to design a secure and efficient two-factor authentication scheme remains an open issue. Hundreds of new schemes have wave upon wave been proposed, yet most of them are shortly found unable to achieve some important security goals (e.g., truly two-factor security) and desirable properties (e.g., user anonymity), falling into the unsatisfactory "break-fix-break-fix" cycle. In this vicious cycle, protocol designers often advocate the superiorities of their improved scheme, but do not illustrate (or unconsciously overlooking) the aspects on which their scheme performs poorly. In this paper, we first use a series of "improved schemes" over Xu et al.'s 2009 scheme as case studies to highlight that, if there are no improved measurements, more "improved schemes" generally would not mean more advancements. To figure out why the measurement of existing schemes is invariably insufficient, we further investigate into the state-of-the-art evaluation criteria set (i.e., Madhusudhan-Mittal's set). Besides reporting its ambiguities and redundancies, we propose viable fixes and refinements. To our knowledge, we for the first time show that there are at least seven different attacking scenarios that may lead to the failure of a scheme in achieving truly two-factor security. Finally, we conduct a large-scale comparative evaluation of 26 representative two-factor schemes, and our results outline the request for better measurement when assessing new schemes.
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
Advanced smart card based password authentication protocol
Song, R. (2010) · Computer Standards & Interfaces · doi:10.1016/j.csi.2010.03.008 · Cited by 274
Who Are You? A Statistical Approach to Measuring User Authenticity
Freeman, D., Jain, S., Duermuth, M., Biggio, B., & Giacinto, G. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23240 · Cited by 123 · cited 1×
“, abnormal login detection, rate-limiting and lockout [12]).”
Background
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-citationJiang, Q., Zeadally, S., Ma, J., & He, D. (2017) · IEEE Access · doi:10.1109/access.2017.2673239 · Cited by 301
Wang, D., Li, W., & Wang, P. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2834351 · Cited by 272
Self-citationFerrag, M. A., Maglaras, L., Derhab, A., & Janicke, H. (2020) · Telecommunication Systems · doi:10.1007/s11235-019-00612-5 · Cited by 71
Vulnerabilities on Hyperledger Fabric
Andola, N., Raghav, Gogoi, M., Venkatesan, S., & Verma, S. (2019) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2019.101050 · Cited by 65
Metadata
- Authors
- Wang, D., Gu, Q., Cheng, H., & Wang, P.
- Venue
- Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2016-05-30
- Pages
- 475-486
- OpenAlex
- W2398070921
- Cited by
- 78
- References
- 2
- FWCI
- 10.31
- 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.