基于几何方法的安全群通信系统密钥分配

Lina Ge
{"title":"基于几何方法的安全群通信系统密钥分配","authors":"Lina Ge","doi":"10.1109/ICFN.2010.51","DOIUrl":null,"url":null,"abstract":"A key assignment scheme for a secure group communication system based on a geometric approach is proposed. Members obtain the group key by solving multiple linear equations, using both the public information on the notice board and the secret information of their own. The proposed scheme can be divided into three phases: user registration, group key assignment, and group key computation. In the user registration phase, the group controller computes and gives a secret to the new user based on geometric approaches. In the group key assignment phase, the group controller first constructs a secret circle using the group key. Then it computes a shadow of group key for each member based on the shared secret. Finally, each member obtains an additional secret point based on the shared secret. The member obtains the group key in the group key computation phase by its shadow and the public information. The experimental results show that the computation of this scheme is simple and fast. It is dynamic because not only initial key distribution, but also auxiliary operations, such as members joining, members leaving, the group key updating are implemented. The forward secrecy and backward secrecy are assured.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Geometric Approaches-Based Key Assignment for Secure Group Communication System\",\"authors\":\"Lina Ge\",\"doi\":\"10.1109/ICFN.2010.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A key assignment scheme for a secure group communication system based on a geometric approach is proposed. Members obtain the group key by solving multiple linear equations, using both the public information on the notice board and the secret information of their own. The proposed scheme can be divided into three phases: user registration, group key assignment, and group key computation. In the user registration phase, the group controller computes and gives a secret to the new user based on geometric approaches. In the group key assignment phase, the group controller first constructs a secret circle using the group key. Then it computes a shadow of group key for each member based on the shared secret. Finally, each member obtains an additional secret point based on the shared secret. The member obtains the group key in the group key computation phase by its shadow and the public information. The experimental results show that the computation of this scheme is simple and fast. It is dynamic because not only initial key distribution, but also auxiliary operations, such as members joining, members leaving, the group key updating are implemented. The forward secrecy and backward secrecy are assured.\",\"PeriodicalId\":185491,\"journal\":{\"name\":\"2010 Second International Conference on Future Networks\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Future Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICFN.2010.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Future Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFN.2010.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种基于几何方法的安全群通信系统密钥分配方案。成员利用布告栏上的公开信息和自己的秘密信息,通过求解多个线性方程获得群密钥。该方案可分为三个阶段:用户注册、组密钥分配和组密钥计算。在用户注册阶段,组控制器基于几何方法计算并给出新用户的秘密。在群密钥分配阶段,群控制器首先使用群密钥构造一个秘密环。然后根据共享密钥计算每个成员的组密钥影子。最后,每个成员在共享秘密的基础上获得一个额外的秘密点。在组密钥计算阶段,成员通过自己的影子和公开信息获取组密钥。实验结果表明,该方案计算简单、速度快。它是动态的,因为它不仅实现了初始密钥分发,还实现了成员加入、成员离开、组密钥更新等辅助操作。保证前向保密和后向保密。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Geometric Approaches-Based Key Assignment for Secure Group Communication System
A key assignment scheme for a secure group communication system based on a geometric approach is proposed. Members obtain the group key by solving multiple linear equations, using both the public information on the notice board and the secret information of their own. The proposed scheme can be divided into three phases: user registration, group key assignment, and group key computation. In the user registration phase, the group controller computes and gives a secret to the new user based on geometric approaches. In the group key assignment phase, the group controller first constructs a secret circle using the group key. Then it computes a shadow of group key for each member based on the shared secret. Finally, each member obtains an additional secret point based on the shared secret. The member obtains the group key in the group key computation phase by its shadow and the public information. The experimental results show that the computation of this scheme is simple and fast. It is dynamic because not only initial key distribution, but also auxiliary operations, such as members joining, members leaving, the group key updating are implemented. The forward secrecy and backward secrecy are assured.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信