A Secure Two-Factor Authentication Scheme From Password-Protected Hardware Tokens

被引:12
作者
Li, Shanshan [1 ,2 ]
Xu, Chunxiang [1 ,2 ]
Zhang, Yuan [1 ,2 ]
Zhou, Jianying [3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Peoples R China
[2] Univ Elect Sci & Technol China, Yangtze Delta Reg Inst Huzhou, Huzhou 313001, Peoples R China
[3] Singapore Univ Technol & Design, Ctr Res Cyber Secur, Singapore 487372, Singapore
基金
中国国家自然科学基金;
关键词
Authentication; Hardware; Passwords; Smart cards; Resists; Standards; Smart phones; Two-factor authentication; dictionary guessing attacks; backdoor attacks; mislaying attacks; EFFICIENT;
D O I
10.1109/TIFS.2022.3209886
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We investigate existing "password+hardware token"-based authentication schemes deployed in real-world applications and observe that they are vulnerable to critical threats. Specifically, a compromised manufacturer may issue a backdoored hardware token to a user and later recover the user's secret, which is well known as backdoor attacks. Additionally, an authentication credential in these schemes consists of two parts: the one is derived from the password, the other one is derived from the hardware token. However, since the two parts are independent of each other, if an adversary can physically access the hardware token of a victim, he is able to break security of these schemes by performing dictionary-guessing attacks (DGA), which is called mislaying-then-DGA. In this paper, we design a non-interactively re-randomizable reverse firewall signature mechanism for securing hardware tokens, such that the user's secret is well protected even if a backdoor is embedded. We also utilize a servers-aided password-based encryption mechanism to harden hardware tokens, so as to "seamlessly" integrate the two factors into one credential. Based on the above mechanisms, we develop a secure two-factor authentication scheme, dubbed ATTACH. We evaluate ATTACH in terms of security and efficiency to demonstrate it achieves a strong security guarantee with high efficiency.
引用
收藏
页码:3525 / 3538
页数:14
相关论文
共 51 条
[1]  
Abraham D., 2009, Network Security, V2009, P4, DOI [10.1016/S1353-4858(09)70097-2, DOI 10.1016/S1353-4858(09)70097-2]
[2]   PASTA: PASsword-based Threshold Authentication [J].
Agrawal, Shashank ;
Miao, Peihan ;
Mohassel, Payman ;
Mukherjee, Pratyay .
PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, :2042-2059
[3]  
ALEX HALDERMAN J., 2005, Proceedings of the WWW, P471
[4]   Scrypt Is Maximally Memory-Hard [J].
Alwen, Joel ;
Chen, Binyi ;
Pietrzak, Krzysztof ;
Reyzin, Leonid ;
Tessaro, Stefano .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III, 2017, 10212 :33-62
[5]   On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model [J].
Alwen, Joel ;
Chen, Binyi ;
Kamath, Chethan ;
Kolmogorov, Vladimir ;
Pietrzak, Krzysztof ;
Tessaro, Stefano .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 :358-387
[6]  
[Anonymous], 2012, P USENIX SEC S BELL
[7]   Subversion-Resilient Signature Schemes [J].
Ateniese, Giuseppe ;
Magri, Bernardo ;
Venturi, Daniele .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :364-375
[8]  
Balfanz D., 2015, FIDO Alliance Proposed Standard, P1
[9]   BlueWallet: The secure Bitcoin wallet [J].
Bamert, Tobias ;
Decker, Christian ;
Wattenhofer, Roger ;
Welten, Samuel .
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8743 :65-80
[10]   Universally composable security: A new paradigm for cryptographic protocols [J].
Canetti, R .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145