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.
[1]
K. Kurosawa,et al.
New EIGamal Type Threshold Digital Signature Scheme
,
1996
.
[2]
Torben P. Pedersen.
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
,
1991,
CRYPTO.
[3]
Adi Shamir,et al.
How to share a secret
,
1979,
CACM.
[4]
Chen Xiao.
Receipt-Free Electronic Voting Based on Semi-Trusted Model
,
2003
.
[5]
David Clark,et al.
Face-to-Face with Peer-to-Peer Networking
,
2001
.
[6]
Ernesto Damiani,et al.
Choosing reputable servents in a P2P network
,
2002,
WWW.
[7]
David Chaum,et al.
Untraceable electronic mail, return addresses, and digital pseudonyms
,
1981,
CACM.
[8]
Hugo Krawczyk,et al.
Robust Threshold DSS Signatures
,
1996,
EUROCRYPT.