Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Using the small-world model to improve freenet performance
ACM SIGCOMM Computer Communication Review
Schedulable region for VBR media transmission with optimal resource allocation and utilization
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent multimedia computing and networking
Protecting Free Expression Online with Freenet
IEEE Internet Computing
P5: A Protocol for Scalable Anonymous Communication
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
An Optimal Strategy for Anonymous Communication Protocols
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
| Hi-index | 0.00 |
Due to the rising of on-line computer and communication applications, users require an anonymous channel to transfer sensitive or confidential data on the networks. How to construct a safe communication environment to guarantee the mutual anonymity during communications becomes an important problem. Recently, researchers have focused on applying the ALR (application-level routing) framework to perform private communications on top of IP networks. The Freenet system is one of the most famous models. Like other ALR solutions, Freenet needs no special device to support mutual anonymous communications. However, it stores and backwards response data over the entire routing path, which causes lots of time and resources wasted. Although the result of our previous research [11] has already improved the performance of Freenet, the location of the source peer still remains unprotected. In this paper, we apply anonymous-shortcut on mutual anonymous communications. The proposed mechanism permits users to choose different security levels on their own demands for not only the request peer but also the source peer. It provides anonymous delivery to support real-time communications [9-10] with acceptable security and controllable delay.