Description

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 anactively secure protocol from a passively secure one.