| A Threshold Scheme under Peer-to-Peer Network |
| |
| 引用本文： | XIE Yumin SHI Feng MING Yang MUHAMMAD Kamran XU Jianqiang. A Threshold Scheme under Peer-to-Peer Network[J]. 武汉大学学报:自然科学英文版, 2006, 11(6): 1741-1744. DOI: 10.1007/BF02831864 |
| |
| 作者姓名： | XIE Yumin SHI Feng MING Yang MUHAMMAD Kamran XU Jianqiang |
| |
| 作者单位： | [1]Department of Computer Science and Engineering, Beijing Institute of Technology, Beijing 100081, China [2]State Key Laboratory of Integrated Service Networks, Xidian University, Xi＇an 710071, Shaanxi, China |
| |
| 摘 要： | Resource sharing among peers is one of important application in Peer-to-Peer（P2P） network. Inexistenee of server makes P2P network to be a less trustable tool for property owners to distribute their resource. In order to protect intelligent property, reputation management strategy is adopted in many P2P network. As long as a P2P network reputation strategy is confirmed, application designer can employ a special detailed distribution scheme to fulfill content distribution within the net. Shmir （k, n） threshold scheme, for example, is an encryption scheme to enhance the distribution se curity of this kind of design. （k＊, n） threshold scheme is a new tool similar to Shmir scheme is proposed in this paper. The new scheme based on polynomial expansion and its security is decided by the one way function used in the secret distribution procedure. The scheme efficiency and its features as well as comparison between new and Shmir scheme are also discussed in this paper.
|
| 关 键 词： | P2P 名誉管理 电子商务 阈值计划 资源分配 |
| 文章编号： | 1007-1202（2006）06-1741-04 |
| 收稿时间： | 2006-05-20 |
A threshold scheme under peer-to-peer network |
| |
| Xie Yumin,Shi Feng,Ming Yang,Muhammad Kamran,Xu Jianqiang. A threshold scheme under peer-to-peer network[J]. Wuhan University Journal of Natural Sciences, 2006, 11(6): 1741-1744. DOI: 10.1007/BF02831864 |
| |
| Authors: | Xie Yumin Shi Feng Ming Yang Muhammad Kamran Xu Jianqiang |
| |
| 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 |
| |
| Abstract: | Resource sharing among peers is one of important application in Peer-to-Peer(P2P) network. Inexistence of server makes P2P network to be a less trustable tool for property owners to distribute their resource. In order to protect intelligent property, reputation management strategy is adopted in many P2P network. As long as a P2P network reputation strategy is confirmed, application designer can employ a special detailed distribution scheme to fulfill content distribution within the net. Shmir (k,n) threshold scheme, for example, is an encryption scheme to enhance the distribution security of this kind of design. (k,n) threshold scheme is a new tool similar to Shmir scheme is proposed in this paper. The new scheme based on polynomial expansion and its security is decided by the one way function used in the secret distribution procedure. The scheme efficiency and its features as well as comparison between new and Shmir scheme are also discussed in this paper. |
| |
| Keywords: | (k,n) threshold scheme P2P (k*,n) threshold scheme reputation management |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
