An Efficient Anonymity Protocol for Grid Computing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
A Mutual Anonymous Peer-to-Peer Protocol Design
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
Multiagent and Grid Systems
Simple efficient mutual anonymity protocols for peer-to-peer network based on primitive roots
Journal of Network and Computer Applications
Mutual anonymous overlay multicast
Journal of Parallel and Distributed Computing - Special issue: Security in grid and distributed systems
MuON: Epidemic based mutual anonymity in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey on anonymity in unstructured peer-to-peer systems
Journal of Computer Science and Technology
Privacy-conscious P2P data sharing scheme with bogus profile distribution
Web Intelligence and Agent Systems
Implementing DRM over peer-to-peer networks with broadcast encryption
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
A design of overlay anonymous multicast protocol
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Relationships and data sanitization: a study in scarlet
Proceedings of the 2010 workshop on New security paradigms
A random walk based anonymous peer-to-peer protocol design
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
We present several protocols to achieve mutual communication anonymity between an information requester and a provider in a P2P information-sharing environment, such that neither the requester nor the provider can identify each other, and no other peers can identify the two communicating parties with certainty. Most existing solutions achieve mutual anonymity in pure P2P systems without any trusted central controls. Compared with two such representative ones, our protocols improve efficiency in two different ways. First, utilizing trusted third parties and aiming at both reliability and low-cost, we propose a group of mutual anonymity protocols. We show that with some limited central support, our protocols can accomplish the goals of anonymity, efficiency, and reliability. Second, we propose a mutual anonymity protocol which relies solely on self-organizations among peers without any trusted central controls. In this protocol, the returning path can be shorter than the requesting path. This protocol does not need to broadcast the requested file back to the requester so that the bandwidth is saved and efficiency is improved. In addition, this protocol does not need special nodes to keep indices of sharing files, thus eliminating the index maintenance overhead and the potential for inconsistency between index records and peer file contents. We have evaluated our techniques in a browser-sharing environment. We show that the average increase in response time caused by our protocols is negligible, and these protocols show advantages over existing protocols in a P2P system.