计算机科学
可用性
密码
认证(法律)
多因素身份验证
计算机安全
可用的
因子(编程语言)
计算机网络
身份验证协议
密码协议
秘密分享
报文认证码
集合(抽象数据类型)
协议(科学)
计算机安全模型
可证明的安全性
密码学
共享秘密
方案(数学)
质询-响应身份验证
封面(代数)
安全性分析
预共享密钥
互联网安全
轻量级可扩展身份验证协议
安全协会
模糊逻辑
挑战握手验证协议
安全参数
访问控制
网络访问控制
作者
Wenting Li,Haibo Cheng,Kaitai Liang
标识
DOI:10.1109/tifs.2025.3622084
摘要
Multi-factor authentication (MFA) is widely used to secure high-value digital assets in web applications. Traditionalt-factor authentication (t-FA) enhances security by requiring users to presenttfactors, which often becomes inconvenient as the number of required factors increases. Threshold (t, n)-MFA (T-MFA) improves usability by allowing users to authenticate with anytfactors from a set ofn. However, T-MFA treats all factors as equal, ignoring the varying security strengths of different factors. For instance, passwords are generally less secure than smart cards, yet T-MFA fails to account for these differences. This restricts its ability to balance security and usability effectively. To overcome this, we proposeAS-MFA, a new primitive allowing users to configure factor combinations based on the security strength of each factor. Our scheme employs secret sharing for general access structures, ensuring that authentication is granted only when a valid combination of factors is presented. Unlike T-MFA limited to threshold configurations, AS-MFA supports arbitrary factor combinations, offeringgreater user autonomy. We formally define the security of AS-MFA and prove the security of our design. In terms of performance, the protocol requiresonly twocommunication rounds and achieves computational efficiency, involvingt2fuzzy extractor operations, 2 + 3t1+ 3t2exponentiations, and 2 multi-exponentiations for a factor combination consisting oft1passwords,t2biometrics, andt3devices. For threshold configurations, AS-MFA outperforms Li et al.’s T-MFA by requiring fewer exponentiation operations, offering aconstantand lower computation cost compared to thelinearcost intof T-MFA.
科研通智能强力驱动
Strongly Powered by AbleSci AI