| 1 | Minimum Exact Cover Problem of Group Key Distribution显示文摘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, mini-mum 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. | FU Xiong1,2, XU Shouzhi3 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 | 2009 | Wuhan University Journal of Natural Sciences2009，14，2： | 2 |
您所在的机构暂未开通此部分的功能，请联系管理员