基于后量子安全格的移动通信认证密钥建立协议构建

IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2025-01-20 DOI:10.1002/cpe.8369
Sunil Kumar, Gaurav Mittal, Arvind Yadav
{"title":"基于后量子安全格的移动通信认证密钥建立协议构建","authors":"Sunil Kumar,&nbsp;Gaurav Mittal,&nbsp;Arvind Yadav","doi":"10.1002/cpe.8369","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>A three-party post-quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric-key encryption AES-256 algorithm. Although there are few third-party post-quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication\",\"authors\":\"Sunil Kumar,&nbsp;Gaurav Mittal,&nbsp;Arvind Yadav\",\"doi\":\"10.1002/cpe.8369\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>A three-party post-quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric-key encryption AES-256 algorithm. Although there are few third-party post-quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 3\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2025-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8369\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8369","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

三方后量子密钥协议涉及服务器与两个通信方以抵抗量子攻击的方式安全地商定共享密钥。一旦使用经过身份验证的密钥协议共享了共享密钥,用户(A)和用户(B)就可以使用对称密钥加密AES-256算法来保护通信通道。虽然目前存在的第三方后量子认证和密钥协议方案很少,但最近的研究表明,它们不满足不可链接性、匿名性、完全前向保密性和信号泄漏攻击等特性。因此,该协议保证了匿名性、不可链接性、完美的前向保密性和抗信号泄漏攻击。该协议对每个会话使用不同的随机数,并保证会话密钥的新鲜度以保持前向保密。在该协议中,用户(A)只与服务器通信,并与用户(B)建立一个身份验证的会话密钥,从而避免了服务器开销。使用带错误的环学习(RLWE)而不是更简单的带错误学习(LWE)主要是出于加密应用程序中对效率、紧凑性和可扩展性的需求。通过性能和安全评估的比较研究表明,所提出的设计更安全、更高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication

A three-party post-quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric-key encryption AES-256 algorithm. Although there are few third-party post-quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
FSDMeL: Few-Shot Enabled Distributed Meta-Learning Model for Image Recognition An Empirical Comparison of Kryo Serialization Optimization Strategies in Apache Spark: Cloud-Based Evaluation at Scale Issue Information An Effective Cognitive Cybersecurity System of Cognitive Sciences Using Adaptive Transformer-Based Deep Learning Model RAAS: Runtime Adaptive Approximation System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1