Minimum exact cover problem of group key distribution |
| |
| Authors: | Xiong Fu Shouzhi Xu |
| |
| Institution: | (1) School of Law, Wuhan University, Wuhan, 430072, Hubei, China;(2) Department of Technology, Guangzhou Luogang District People’s Court, Guangzhou, 510730, Guangdong, China;(3) College of Electronic Engineering and Information Technology, China Three Gorges University, Yichang, 443002, Hubei, China |
| |
| Abstract: | Secure group communications are restrained by the number of the group size, number of changes and their distribution, all
existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum
exact cover problem for group key distribution (GMECP) is presented, and a heuristic solution is testified. Then an algorithm
of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests
with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency
of any tree-based group key management.
|
| |
| Keywords: | minimum exact cover problem group key distribution secure multicast group key management |
| 本文献已被 SpringerLink 等数据库收录！ |
|
