Abstract
The key problem of securing multicast is to generate, distribute and update Session Encryption Key (SEK). Polynomial expansion with multi-seed (MPE) scheme is an approach which is based on Polynomial expansion (PE) scheme and overcomes PE's shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number (SPN). Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Xu Mingwei, Dong Xiaohu, Xu Luo. A Survey of Research on Key Management for Multicast [J].Journal of Software, 2004,15(1):141–150 (Ch).
Zhu Wentao, Xiong Jiping, Li Jinshenget al. A Study of the Key Distribution in Secure Multicast [J].Journal of Software, 2003,14(12):2052–2059 (Ch).
Xie Yumin, Shi Feng, Muhammad Kamran. Implement MPE Scheme with Strict Prime Number [J].WSEAS Trasaction on Computers, 2005,5(6):1118–1123.
Mao W.Modern Cryptography: Theory and Practice [M]. Beijing: Publishing House of Electronics Industry, 2004 (Ch).
Trappe W, Song J, Poovendran R,et al. Key Distribution for Secure Multimedia Multicasts via Data Embedding [C]//Proceedings of the Acoustics, Speech, and Signal Processing. Salt Lake City, 2001:1449–1452.
Wang Ying. A Fast Way to Find a Big Prime Number in RSA Scheme [J].Journal of Hunan University of Science and Engineering, 2005,26(5):14–16 (Ch).
Network Working Group. Group Key Management Protocol Specification[EB/OL]. [2006-01-16].http://www.cnpaf. net/Class/Rfcen/0532918535388516.html.
Setiner H, Taudik G, Waidnet M.Cliques: A New Approach to Group Key Agreement [R]. Technical Report, RZ 2984, IBM Research, 1997.
Chiou G, Chen W. Secure Broadcasting Using the Secure Lock [J].IEEE Transactions on Software Engineering, 1989,15(8):929–934.
Poovendran R, John S, Baras. An Information-Theoretic Approach for Design and Analysis of Rooted-Tree-Based Multicast Key Management Schemes [J].IEEE Trasactions on sInformation Theory, 2001,47(7):2824–2834.
Wong C, Gouda M, Lam S. Secure Group Communications Using Key Graphs[J].ACM Trans Networking, 2000,8 (1): 16–30.
Canetti R, Malkin T, Nissim K. Efficient Communication Storage Tradeoffs for Multicast Encryption [J].Lectures Notes in Computer Science, 1999,1599(1):459–474.
Perrig A, Song D, Tygar J. ELK, A New Protocol for Efficient Large-Group Key Distribution[C]//Proceedings of the IEEE Symposium on Security and Privacy. Oakland, Calif, May 2001:247–262.
Dondeti L, Mukherjee S, Samal A. Scalable Secure One-to-Many Group Communication Using Dual Encryption [J].Computer Communications, 1999,23(17): 1681–1701.
Molva R, Pannetrat A. Scalable Multicast Security in Dynamic Groups[C]//Proceedings of the 6th ACM Conference on Computer and Communications Security. New York: ACM Press, 1999:101–112.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60473072)
Biography: XIE Yumin(1970-), male, Ph. D. candidate, research direction: computer supported cooperative work.
Rights and permissions
About this article
Cite this article
Yumin, X., Feng, S., Yang, M. et al. Multi-seed key distribution scheme test. Wuhan Univ. J. Nat. Sci. 11, 1243–1248 (2006). https://doi.org/10.1007/BF02829244
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02829244