基于私有共享密钥的互认证协议的加密计算:无线网络仿真与建模

Bruce Ndibanje, Hoon-Jae Lee
{"title":"基于私有共享密钥的互认证协议的加密计算:无线网络仿真与建模","authors":"Bruce Ndibanje, Hoon-Jae Lee","doi":"10.1109/ICOIN.2014.6799747","DOIUrl":null,"url":null,"abstract":"Protecting communication among sender and receiver over a public channel network requires for the most part an important security mechanism to provide two parties with the property that they can authenticate each other's identification parameters which are indispensable to construct a common private key. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than “classical” Diffe-Hellman key exchange which provides no authentication at all. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by CrypTool 2.0 to verify the feasibility and shared secret value sameness. The resultant shows that the protocol is practical and provably-secure in regards with standard cryptographic assumptions. Moreover, the value that would be exchanged can be used as secret key for further encrypted symmetric communication. The proposed method is awfully straightforward, valuable, and resilient to know attacks.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cryptographic computation of private shared key based mutual authentication protocol: Simulation and modeling over wireless networks\",\"authors\":\"Bruce Ndibanje, Hoon-Jae Lee\",\"doi\":\"10.1109/ICOIN.2014.6799747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Protecting communication among sender and receiver over a public channel network requires for the most part an important security mechanism to provide two parties with the property that they can authenticate each other's identification parameters which are indispensable to construct a common private key. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than “classical” Diffe-Hellman key exchange which provides no authentication at all. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by CrypTool 2.0 to verify the feasibility and shared secret value sameness. The resultant shows that the protocol is practical and provably-secure in regards with standard cryptographic assumptions. Moreover, the value that would be exchanged can be used as secret key for further encrypted symmetric communication. The proposed method is awfully straightforward, valuable, and resilient to know attacks.\",\"PeriodicalId\":388486,\"journal\":{\"name\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2014.6799747\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The International Conference on Information Networking 2014 (ICOIN2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2014.6799747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在公共信道网络上,保护发送方和接收方之间的通信,在很大程度上需要一种重要的安全机制,为双方提供可以相互验证身份参数的属性,而这些参数对于构建公共私钥是必不可少的。基于决定性的Diffie-Hellman假设,本文提出了一种共享密钥的加密计算方法,使公共、不安全网络上的相互认证和保密服务成为可能。该协议比完全不提供身份验证的“经典”Diffe-Hellman密钥交换更有效。为了实现这一目标,我们首先使用实体参数对该方案进行指数计算的数学概念建模,最后使用CrypTool 2.0进行仿真,验证了该方案的可行性和共享密钥值的一致性。结果表明,该协议在标准密码学假设下是实用且可证明安全的。此外,交换的值可以用作进一步加密对称通信的秘密密钥。所提出的方法非常直接,有价值,并且对已知攻击具有弹性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cryptographic computation of private shared key based mutual authentication protocol: Simulation and modeling over wireless networks
Protecting communication among sender and receiver over a public channel network requires for the most part an important security mechanism to provide two parties with the property that they can authenticate each other's identification parameters which are indispensable to construct a common private key. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than “classical” Diffe-Hellman key exchange which provides no authentication at all. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by CrypTool 2.0 to verify the feasibility and shared secret value sameness. The resultant shows that the protocol is practical and provably-secure in regards with standard cryptographic assumptions. Moreover, the value that would be exchanged can be used as secret key for further encrypted symmetric communication. The proposed method is awfully straightforward, valuable, and resilient to know attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信