Securing group key exchange against strong corruptions and key registration attacks

E. Bresson, M. Manulis
{"title":"Securing group key exchange against strong corruptions and key registration attacks","authors":"E. Bresson, M. Manulis","doi":"10.1504/IJACT.2008.021083","DOIUrl":null,"url":null,"abstract":"In Group Key Exchange (GKE) protocols, users usually extract the group key using some auxiliary (ephemeral) secret information generated during the execution. Strong corruptions are attacks by which an adversary can reveal these ephemeral secrets, in addition to the possibly used long-lived keys. Undoubtedly, security impact of strong corruptions is serious, and thus specifying appropriate security requirements and designing secure GKE protocols appears an interesting yet challenging task – the aim of our article. We start by investigating the current setting of strong corruptions and derive some refinements like opening attacks that allow to reveal ephemeral secrets of users without their long-lived keys. This allows to consider even stronger attacks against honest, but 'opened' users. Further, we define strong security goals for GKE protocols in the presence of such powerful adversaries and propose a 3-round GKE protocol, named TDH1, which remains immune to their attacks under standard cryptographic assumptions. Our security definitions allow adversaries to register users and specify their long-lived keys, thus, in particular capture attacks of malicious insiders for the appropriate security goals such as Mutual Authentication, key confirmation, contributiveness, key control and key-replication resilience.","PeriodicalId":350332,"journal":{"name":"Int. J. Appl. Cryptogr.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Appl. Cryptogr.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJACT.2008.021083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

In Group Key Exchange (GKE) protocols, users usually extract the group key using some auxiliary (ephemeral) secret information generated during the execution. Strong corruptions are attacks by which an adversary can reveal these ephemeral secrets, in addition to the possibly used long-lived keys. Undoubtedly, security impact of strong corruptions is serious, and thus specifying appropriate security requirements and designing secure GKE protocols appears an interesting yet challenging task – the aim of our article. We start by investigating the current setting of strong corruptions and derive some refinements like opening attacks that allow to reveal ephemeral secrets of users without their long-lived keys. This allows to consider even stronger attacks against honest, but 'opened' users. Further, we define strong security goals for GKE protocols in the presence of such powerful adversaries and propose a 3-round GKE protocol, named TDH1, which remains immune to their attacks under standard cryptographic assumptions. Our security definitions allow adversaries to register users and specify their long-lived keys, thus, in particular capture attacks of malicious insiders for the appropriate security goals such as Mutual Authentication, key confirmation, contributiveness, key control and key-replication resilience.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
保护组密钥交换免受严重损坏和密钥注册攻击
在组密钥交换(GKE)协议中,用户通常使用在执行过程中生成的一些辅助(临时)秘密信息提取组密钥。强破坏是指攻击者除了可能使用的长期密钥之外,还可以泄露这些短暂的秘密。毫无疑问,强腐败对安全的影响是严重的,因此,指定适当的安全需求和设计安全的GKE协议似乎是一项有趣但具有挑战性的任务——这也是本文的目的。我们首先调查当前的强破坏设置,并得出一些改进,例如开放攻击,允许在没有长期密钥的情况下泄露用户的短暂秘密。这允许考虑对诚实但“开放”的用户进行更强的攻击。此外,我们为存在如此强大的对手的GKE协议定义了强大的安全目标,并提出了一个名为TDH1的3轮GKE协议,该协议在标准加密假设下仍然不受攻击。我们的安全定义允许攻击者注册用户并指定他们的长期密钥,因此,特别是捕获恶意内部人员的攻击,以实现适当的安全目标,如相互身份验证、密钥确认、贡献性、密钥控制和密钥复制弹性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic MDS diffusion layers with efficient software implementation Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level Delegation-based conversion from CPA to CCA-secure predicate encryption Preventing fault attacks using fault randomisation with a case study on AES A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
×
引用
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