Group Key Agreement with Local Connectivity
IEEE Trans. Dependable Sec. Comput.(2016)
摘要
In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an actively secure protocol from a passively secure one.
更多查看译文
关键词
diffie-hellman,group key agreement,authentication,lower bound,protocol
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络