Journal of the ACM (JACM)
Communications of the ACM
Anonymous Web transactions with Crowds
Communications of the ACM
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
The free haven project: distributed anonymous storage service
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Web MIXes: a system for anonymous and unobservable Internet access
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Publius: a robust, tamper-evident, censorship-resistant web publishing system
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
P2P network has been emerging as a very attractive content distribution mechanism. Nevertheless flooding based applications and systems with distribution hash tables based model, which are already developed, are having difficulty in the development and the application because they do not satisfy many issues such as privacy protection of end-user. In this study we propose neighbor-set based privacy protection model. The proposed technique is based on the typical distributed hash tables model, chord, and was designed to be protected from attack by securing anonymity to participating nodes. Proposed protecting scheme and how to solve the problem of load balancing caused in the process will be explained.