A Threshold Scheme under Peer-to-Peer Network  

作　　者：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

出　　处：《Wuhan University Journal of Natural Sciences》2006年第6期1741-1744,共4页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foun-dation of China (60473072)

摘　　要：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.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.

关 键 词：（k  n） threshold scheme P2P （k＊  n） threshold scheme reputation management 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]