首页> 外文会议>IFIP TC 11 International conference on information security and privacy >Chaotic Chebyshev Polynomials Based Remote User Authentication Scheme in Client-Server Environment
【24h】

Chaotic Chebyshev Polynomials Based Remote User Authentication Scheme in Client-Server Environment

机译:Chaotic Chebyshev基于多项式的客户端 - 服务器环境中的远程用户身份验证方案

获取原文

摘要

Perfect forward secrecy is considered as the most important standard to evaluate a strong authentication scheme. There are many results researched to achieve this property without using hard problems. Recently, the result of Chang et al has some advances such as, the correctness of schemes mutual authentication and session key agreement demonstrated in BAN-logic or the overheads reduction of system implementation. However, in this paper, we prove that their scheme is still vulnerable to impersonation attacks and session key leakage. To overcome those limitations and be practical, we use different notion to propose time efficient scheme conducted in experiment. Our proposed method can be applied for remote user authentication in various scenarios, including systems with user authentication using mobile or wearable devices.
机译:完美的前锋保密被认为是评估强验证方案的最重要标准。在不使用难题的情况下,有许多结果可以在不使用难题的情况下实现这一财产。最近,长等人的结果有一些进步,如方案相互认证和会议关键协议的正确性,禁止逻辑或系统实施的开销减少。然而,在本文中,我们证明了他们的计划仍然容易受到模拟攻击和会话密钥泄漏的影响。为了克服这些限制并实用,我们使用不同的概念来提出在实验中进行的时间效率方案。我们所提出的方法可以应用于各种场景中的远程用户身份验证,包括使用移动或可穿戴设备的用户身份验证的系统。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号