Simple efficient mutual anonymity protocols for peer-to-peer network based on primitive roots

  • Authors:
  • Chin-Chen Chang;Chih-Yang Lin;Keng-Chu Lin

  • Affiliations:
  • Department of Information Engineering and Computer Science, Feng Chia University, Taichung, 100 Wenhwa Road, Taiwan 40724, ROC and Department of Computer Science and Information Engineering, Natio ...;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 621, ROC;Department of Computer Science, National Tsing Hua University, HsingChu, Taiwan 300, ROC

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present two types of protocols that can achieve mutual anonymity in peer-to-peer (P2P) network environments, which means the identities of the service, requesters and providers, are anonymous to each other, to other peers, and even to the trusted third party (TTP). One of the two types of protocols is for hybrid P2P systems where there is a TTP to construct the transmission paths and look up the query files. The other type of protocol is for pure P2P environments where no TTP is involved in the session network. These two new protocols are based on primitive roots for three main reasons: simplicity, flexibility, and efficiency. Other issues concerning the P2P network structure as well as the security analyses of the proposed protocols will also be covered in this paper.