Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Query-flood DoS attacks in gnutella
Proceedings of the 9th ACM conference on Computer and communications security
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Hordes: a multicast based protocol for anonymity
Journal of Computer Security
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Mutual Anonymity Protocols for Hybrid Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tracing Anonymous Packets to Their Approximate Source
LISA '00 Proceedings of the 14th USENIX conference on System administration
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Hi-index | 0.00 |
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomness in the selection of intermediate nodes, provides a guarantee of anonymity to some extent. It, however, comes at the cost of a large communication overhead. In this paper, we present Shubac, a searchable, anonymous peer to peer (P2P) overlay network. It implements a flexible dynamic path approach that shrinks paths in size to reduce overhead and delays and meanwhile reconfigures paths dynamically throughout a communication to maintain a high level of privacy. This dynamic path approach enables Shubac to make a good tradeoff between anonymity and efficiency.