[1] Wallner D, Harder E, Agee R. Key Management for Multicast: Issues and Architectures[S]. RFC 2627, 1999. [2] Kim Y, Perrg A, Tsudik G. Tree-based Group Key Agreement[J]. ACM Transactions on Information and System Security, 2004, 7(1): 60-96. [3] Lee Jun-Sik, Son Ju-Hyung, Park Young-Hoon, et al. Optimal Level Homogeneous Tree Structure for Logical Key Hierarchy[C]//Proc. of the 3rd IEEE/Create-Net International Conference on Communication System Software and Middleware. [S. l.]: IEEE Press, 2007: 677-681. [4] Rafaeli S. A Decentralized Architecture for Group Key Management[D]. Lancaster, UK: Lancaster University, 2000. [5] Sun Y an, Ammar M. Scalable Hierarchical Access Control in Secure Group Communications[C]//Proc. of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. [S. l.]: IEEE Press, 2004. [6] Steiner M, Tsudik G, Waidner M. Diffie-Hellman Key Distribution Extended to Group Communication[C]//Proc. of the 3rd ACM Conference on Computer and Communi- cations Security. [S. l.]: ACM Press, 1996: 31-37. [7] Steiner M, Tsudik G, Waidner M. Key Agreement in Dynamic Peer Groups[J]. IEEE Transactions on Parallel and Distributed Systems, 2000, 11(8): 769-780. [8] Shamir A. How to Share a Secret[J]. Communications of the ACM, 1979, 22(11): 612-613. [9] 郭 鑫, 陈克非. 求解本原多项式的快速算法[J]. 计算机工程, 2008, 34(15): 146-147. [10] 黄德双, 池哲儒. 基于神经网络的递推分块方法求任意高阶多项式的根[J]. 中国科学: E辑, 2003, 33(12): 1115-1124. [11] 黄东平, 王华勇, 黄连生, 等. 动态门限秘密共享方 案[J]. 清华大学学报: 自然科学版, 2006, 46(1): 102- 105. |