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 ord...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.展开更多
Coin flipping by telephone protocol（CFP） is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in ...Coin flipping by telephone protocol（CFP） is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in a group environment system. A transmutation of CFP named T-CFP is proposed in this paper. The precondition of T-CFP is the system＇s user trusts the system center and center＇s cheating is meaningless at the same time. The significant difference between CFP and T-CFP is that CFP supports only two users while T-CFP can support many users to exchange special information. The security and efficiency of T-CFP are discussed with a detailed example on T-CFP utilization is demonstrated in this paper.展开更多
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...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.展开更多
基金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.
基金Supported by the National Natural Science Foun-dation of China(60473072)
文摘Coin flipping by telephone protocol（CFP） is utilized in a system to exchange a binary sequence at random between two person apart far from each other. However, CFP cannot he used in a system with many users like in a group environment system. A transmutation of CFP named T-CFP is proposed in this paper. The precondition of T-CFP is the system＇s user trusts the system center and center＇s cheating is meaningless at the same time. The significant difference between CFP and T-CFP is that CFP supports only two users while T-CFP can support many users to exchange special information. The security and efficiency of T-CFP are discussed with a detailed example on T-CFP utilization is demonstrated in this paper.
基金Supported by the National Natural Science Foun-dation of China (60473072)
文摘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.
