基于身份验证和会话密钥协议的全球移动网络新型增强安全匿名通信

Prasanta Kumar Roy, Krittibas Parai, Sathi Ball, B. Kumar
{"title":"基于身份验证和会话密钥协议的全球移动网络新型增强安全匿名通信","authors":"Prasanta Kumar Roy, Krittibas Parai, Sathi Ball, B. Kumar","doi":"10.1109/ICRCICN.2017.8234490","DOIUrl":null,"url":null,"abstract":"Recently, several protocols have been proposed to accomplish user authenticity with proper session key establishment in Global Mobility Network. Unfortunately, some of them still suffer from various security threats and high computational complexity. This article demonstrates a new enhanced two-factor authentication scheme for secure anonymous communication to mutually authenticate the communicating parties and to establish a proper session key between them. The major contributions of this article are 1) to achieve all kind of security goals and 2) to effectively reduce the computational complexity. The underlying construction is developed using Elliptic Curve Cryptography (ECC) along with light-weight processes to ensure the resistibility against well-known security threats and improved computational complexity. The protocol is implemented using HLPSL and formally validated using AVISPA to ensure that it has the ability to withstand several attacks. We have also compared the computational complexity of our protocol with some existing protocols to prove its efficiency.","PeriodicalId":166298,"journal":{"name":"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A new enhanced secure anonymous communication with authentication and session key agreement in global mobility network\",\"authors\":\"Prasanta Kumar Roy, Krittibas Parai, Sathi Ball, B. Kumar\",\"doi\":\"10.1109/ICRCICN.2017.8234490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, several protocols have been proposed to accomplish user authenticity with proper session key establishment in Global Mobility Network. Unfortunately, some of them still suffer from various security threats and high computational complexity. This article demonstrates a new enhanced two-factor authentication scheme for secure anonymous communication to mutually authenticate the communicating parties and to establish a proper session key between them. The major contributions of this article are 1) to achieve all kind of security goals and 2) to effectively reduce the computational complexity. The underlying construction is developed using Elliptic Curve Cryptography (ECC) along with light-weight processes to ensure the resistibility against well-known security threats and improved computational complexity. The protocol is implemented using HLPSL and formally validated using AVISPA to ensure that it has the ability to withstand several attacks. We have also compared the computational complexity of our protocol with some existing protocols to prove its efficiency.\",\"PeriodicalId\":166298,\"journal\":{\"name\":\"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRCICN.2017.8234490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Third International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRCICN.2017.8234490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

近年来,在全球移动网络中提出了几种通过建立适当的会话密钥来实现用户真实性的协议。不幸的是,其中一些仍然受到各种安全威胁和高计算复杂性的影响。本文演示了一种新的增强的双因素身份验证方案,用于安全匿名通信,以相互验证通信方并在它们之间建立适当的会话密钥。本文的主要贡献是:1)实现各种安全目标;2)有效降低计算复杂度。底层结构使用椭圆曲线加密(ECC)以及轻量级进程来开发,以确保对已知安全威胁的抵抗力并提高计算复杂度。该协议使用HLPSL实现,并使用AVISPA进行正式验证,以确保它能够承受多种攻击。我们还将该协议的计算复杂度与一些现有协议进行了比较,以证明其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new enhanced secure anonymous communication with authentication and session key agreement in global mobility network
Recently, several protocols have been proposed to accomplish user authenticity with proper session key establishment in Global Mobility Network. Unfortunately, some of them still suffer from various security threats and high computational complexity. This article demonstrates a new enhanced two-factor authentication scheme for secure anonymous communication to mutually authenticate the communicating parties and to establish a proper session key between them. The major contributions of this article are 1) to achieve all kind of security goals and 2) to effectively reduce the computational complexity. The underlying construction is developed using Elliptic Curve Cryptography (ECC) along with light-weight processes to ensure the resistibility against well-known security threats and improved computational complexity. The protocol is implemented using HLPSL and formally validated using AVISPA to ensure that it has the ability to withstand several attacks. We have also compared the computational complexity of our protocol with some existing protocols to prove its efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信