Robust Multi-Factor Authentication for Fragile Communications
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In large-scale systems, user authentication usually needs the assistance from a remote central authentication server via networks. The authentication service however could be slow or unavailable due to natural disasters or various cyber attacks on communication channels. This has raised serious concerns in systems which need robust authentication in emergency situations. The contribution of this paper is two-fold. In a slow connection situation, we present a secure generic multi-factor authentication protocol to speed up the whole authentication process. Compared with another generic protocol in the literature, the new proposal provides the same function with significant improvements in computation and communication. Another authentication mechanism, which we name stand-alone authentication, can authenticate users when the connection to the central server is down. We investigate several issues in stand-alone authentication and show how to add it on multi-factor authentication protocols in an efficient and generic way.
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
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_4 · Cited by 1,313 · cited 3×
“with smart-card and password, the signature scheme is existentially unforgeable [5] and the ABE has ciphertext indistinguishability [13].”
Background
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
“To address this problem, we can use the cryptographic attributes as credentials in order to exchange session keys [220], [221].”
MethodIoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488
“7 Authentication and secure communication Privacy violation 6LoWPAN adaptation layer, transport layer, network layer Intermediatelevel Compressed AH and ESP, Header compression and software based AES, TPM using RSA, SHA1/AES, hybrid authentication, authentication with fuzzy extractor, encryption of payload dispatch ty…”
MethodMobile edge computing, Fog et al.: A survey and analysis of security threats and challenges
Roman, R., Lopez, J., & Mambo, M. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.009 · Cited by 1,338
“Access Control Systems.”
BackgroundInfluentialTwo 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
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
An overview of Fog computing and its security issues
Stojmenovic, I., Wen, S., Huang, X., & Luan, H. (2016) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.3485 · Cited by 408
Self-citationEnergy-Efficient Computation Offloading for Secure UAV-Edge-Computing Systems
Bai, T., Wang, J., Ren, Y., & Hanzo, L. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2912227 · Cited by 263
Improved ECC-Based Three-Factor Multiserver Authentication Scheme
Wu, T.-Y., Yang, L., Lee, Z., Chen, C.-M., Pan, J.-S., & Islam, S. H. (2021) · Security and Communication Networks · doi:10.1155/2021/6627956 · Cited by 52
Metadata
- Authors
- Huang, X., Xiang, Y., Bertino, E., Zhou, J., & Xu, L.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2014-11
- Volume
- 11
- Issue
- 6
- Pages
- 568-581
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2093798919
- Cited by
- 137
- References
- 2
- FWCI
- 18.49
- Type
- journal article
- Language
- en
- Open access
- green
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.