计算机科学
前向保密
密码
协议(科学)
伪随机数发生器
身份验证协议
计算机安全
密码学
认证(法律)
伪随机函数族
报文认证码
计算机网络
密码协议
保密
密码原语
对手
智能卡
对称密钥算法
信息论安全
可证明的安全性
理论计算机科学
质询-响应身份验证
散列函数
安全性分析
Otway–Rees协议
一次性密码
伪随机发生器
安全参数
功能(生物学)
混凝土安全
作者
Xiaomin Zhao,Qi Gang Jiang,Xin Gong,Meng Li,Xindi Ma,Jianfeng Ma
标识
DOI:10.1109/tifs.2025.3615710
摘要
The combination of smart cards and passwords has given birth to one of the most prevalent two-factor authentication (2FA) approaches. Numerous 2FA schemes have been proposed, nevertheless, most of them either do not possess critical security properties or are not efficient for implementation on smart cards. It is generally considered that asymmetric cryptographic primitives are indispensable to achieve security goals, which are burdensome for resource-limited devices. That is, the literature is being stuck with the security-efficiency tension. In this paper, we propose a 2FA protocol only resorting to symmetric primitives. Specifically, with the puncturable pseudorandom function, the proposed protocol hits three birds: it achieves three subtle security goals, i.e., resisting offline password guessing attacks, perfect forward secrecy and anonymity. It alleviates the long-standing security-efficiency conflict that is considered intractable in the literature. The proposed protocol is provably secure within the harshest adversary model to date. Furthermore, the evaluation results demonstrate that our protocol is the optimal choice when considering both security and efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI