A secure and robust dynamic ID-based mutual authentication scheme with smart card using elliptic curve cryptography

M. Sarvabhatla, C. Vorugunti
{"title":"A secure and robust dynamic ID-based mutual authentication scheme with smart card using elliptic curve cryptography","authors":"M. Sarvabhatla, C. Vorugunti","doi":"10.1109/IWSDA.2015.7458418","DOIUrl":null,"url":null,"abstract":"As networking and wireless communication technologies advance more rapidly, it give rise to a quick change in the m-commerce land scape. The insecure public internet as an access medium resulted in lots of cryptographic attacks on wireless transactions. Due to this, there is an extreme demand for light weight and secure authentication protocols. In this context, few researchers have proposed E.C.C based authentication schemes to validate the legitimacy of the user connecting to remote server. Recently Islam et al has proposed a dynamic ID based authentication scheme using E.C.C and claimed that their scheme is secure and flexible. In this manuscript, we will illustrate that their scheme is susceptible to offline password guessing attack and user impersonation attack. We then communicate a secure and robust authentication scheme, which is resistant to all cryptographic attacks and light weight. We have analyzed security strengths of our scheme formally using random oracle model and game theory.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2015.7458418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

As networking and wireless communication technologies advance more rapidly, it give rise to a quick change in the m-commerce land scape. The insecure public internet as an access medium resulted in lots of cryptographic attacks on wireless transactions. Due to this, there is an extreme demand for light weight and secure authentication protocols. In this context, few researchers have proposed E.C.C based authentication schemes to validate the legitimacy of the user connecting to remote server. Recently Islam et al has proposed a dynamic ID based authentication scheme using E.C.C and claimed that their scheme is secure and flexible. In this manuscript, we will illustrate that their scheme is susceptible to offline password guessing attack and user impersonation attack. We then communicate a secure and robust authentication scheme, which is resistant to all cryptographic attacks and light weight. We have analyzed security strengths of our scheme formally using random oracle model and game theory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于椭圆曲线密码的智能卡动态身份认证方案
随着网络和无线通信技术的快速发展,移动商务领域发生了迅速的变化。由于公共互联网作为一种不安全的访问媒介,导致了大量针对无线交易的加密攻击。因此,对轻量级和安全的身份验证协议有极大的需求。在这种情况下,很少有研究人员提出基于ecc的身份验证方案来验证连接到远程服务器的用户的合法性。最近Islam等人提出了一种基于动态ID的认证方案,并声称该方案具有安全性和灵活性。在本文中,我们将说明他们的方案容易受到离线密码猜测攻击和用户冒充攻击。然后,我们通信一个安全可靠的身份验证方案,它可以抵抗所有加密攻击和轻量级。利用随机oracle模型和博弈论对该方案的安全性进行了形式化分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A lattice coding based non-orthogonal multiple access scheme A new class of optimal optical orthogonal codes with weight six Information set and iterative encoding for Affine Grassmann codes Ensembles of sequences and arrays Lattice network codes over optimal lattices in low dimensions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1