|
Author(s): |
Bo Li, Xi’an Communications Institute, Xi’an, China
Jin Pan, Xi’an Communications Institute, Xi’an, China
Mingkui Han, Xi’an Communications Institute, Xi’an, China
Anlin Chen, Xi’an Communications Institute, Xi’an, China
Xingqi Xu, Xi’an Communications Institute, Xi’an, China
Zhiguang Chen, Xi’an Communications Institute, Xi’an, China |
|
Abstract: |
A new algorithm named ITBR (Improved Tree-based Batch Rekeying) is proposed. The algorithm computes new keys of all renewed nodes in the tree, and then it sends all the rekeying messages, which avoids the problem of out-of-sync between keys and data. To reduce the rekeying cost of this algorithm, the structure of key tree is optimized by three cases. When the number of joins equals to the number of leaves, supposing that every user has probability p of being replaced by a new user, if 0
|