| Multi-Seed Key Distribution Scheme Test |
| |
| 引用本文： | XIE Yumin SHI Feng MING Yang Muhammad Kamran YANG Xiaoxu. Multi-Seed Key Distribution Scheme Test[J]. 武汉大学学报:自然科学英文版, 2006, 11(5): 1243-1248. DOI: 10.1007/BF02829244 |
| |
| 作者姓名： | XIE Yumin SHI Feng MING Yang Muhammad Kamran YANG Xiaoxu |
| |
| 作者单位： | [1]Department of Computer Science and Engineering,Beijing Institute of Technology ,Beijing 100081 ,China [2]State Key Laboratory of Integrated ServiceNetworks, Xidian University, Xi＇ an 710071, Shaanxi,China [3]Nari Group Corporation, Nanjing 210003, Jiangsu,China |
| |
| 摘 要： | The key problem of securing multieast 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.
|
| 关 键 词： | 多项式展开 MPE 单向函数 严格素数 SPN |
| 文章编号： | 1007-1202（2006）05-1243-06 |
| 收稿时间： | 2006-03-08 |
Multi-seed key distribution scheme test |
| |
| Xie Yumin,Shi Feng,Ming Yang,Muhammad Kamran,Yang Xiaoxu. Multi-seed key distribution scheme test[J]. Wuhan University Journal of Natural Sciences, 2006, 11(5): 1243-1248. DOI: 10.1007/BF02829244 |
| |
| Authors: | Xie Yumin Shi Feng Ming Yang Muhammad Kamran Yang Xiaoxu |
| |
| Affiliation: | (1) Department of Computer Science and Engineering, Beijing Institute of Technology, 100081 Beijing, China;(2) State Key Laboratory of Integrated Service Networks, Xidian University, 710071 Xi'an, Shaanxi, China;(3) Nari Group Corporation, 210003 Nanjing, Jiangsu, China |
| |
| 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. 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. |
| |
| Keywords: | polynomial expansion with multi-seed(MPE) multi-seed one way function strict prime number(SPN) |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
