Wuhan University Journal of Natural Sciences

, Volume 11, Issue 6, pp 1741–1744 | Cite as

A threshold scheme under peer-to-peer network

  • Xie Yumin
  • Shi Feng
  • Ming Yang
  • Muhammad Kamran
  • Xu Jianqiang
Security of Network and Communication


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.

Key words

(k, n) threshold scheme P2P (k', n) threshold scheme reputation management CLC number TP 309 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Clark D. Face-to-Face with Peer-to-Peer Networking [J].IEEE Computer, 2001,34(1):18–21.Google Scholar
  2. [2]
    Cornelli F, Damiani E, Vimercati S D C,et al. Choosing Reputable Servents in a P2P Networks[C]//Proceedings of the 11th World Wide Web Conference. Honolulu, Hawaii, May, 2002: 376–386.Google Scholar
  3. [3]
    Kamvar S D, Schlosser M T, Molina H G. EigenRep: Repulation Management in P2P Networks[C] //Proceedings of the Twelfth International World Wide Web Conference. Budapest: ACM Press, 2003:123–134.Google Scholar
  4. [4]
    Shamir A. How to Share a Secret[J].Comm of the ACM, 1979,22(11):612–613.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Park C, Kurosawa K. New ElGamal Type Treshold Signature Scheme[J].IEICE Transactions on Foundational Electronic Communications and Computer Science, 1996,E79-A (1):86–93.Google Scholar
  6. [6]
    Gennaro R, Jarecki S, Krawczyk H,et al. Robust Threshold DSS Signature[C] //Proceedings of Cryptology. Berlin: Springer, 1996: 354–371.Google Scholar
  7. [7]
    Pedersen T P. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing[C] //Advances in Cryptology-Crypto' 91. New York: Springer-Verlag, 1991:129–140.Google Scholar
  8. [8]
    Xie Yumin, Shi Feng, Kamran M. Implement M-PE Scheme with Strict Prime Number[J].Wseas Transactions on Computers, 2006,5(6):1118–1123.Google Scholar
  9. [9]
    Chaum D L, Untraceable Electronic Mail Return Addresses, and Digital Pseudonyms[J].Communications of the ACM, 1981,24(2):84–90.CrossRefGoogle Scholar
  10. [10]
    Chen Xiaofeng. Recelpt Free Electronic Voting Based on Semi-Trusted Model[J].Chinese Journal of Computers, 2003,26(5):557–562(Ch).Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • Xie Yumin
    • 1
  • Shi Feng
    • 1
  • Ming Yang
    • 2
  • Muhammad Kamran
    • 1
  • Xu Jianqiang
    • 1
  1. 1.Department of Computer Science and EngineeringBeijing Institute of TechnologyBeijingChina
  2. 2.State Key Laboratory of Integrated Service NetworksXidian UniversityXi'an, ShaanxiChina

Personalised recommendations