loading...
Anonymity Scheme for Interactive P2P Services
May 19-May 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2008.542008 Eighth IEEE International Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The flourishing of Peer-to-Peer (P2P) applications has encouraged extensive research on end-to-end anonymity. In particular, interactive services such as VoIP and instant messaging are becoming extremely popular and require low latency. Preserving the anonymity of users in such services is becoming a major challenge. While existing schemes provide anonymity for the communicating parties; they incur high latency and are not suitable for interactive services. Even designs that attempt to reduce the latency, employ an encryption scheme that involves acomparatively high computation overhead and delay.In this paper, we describe a novel low-latency P2P scheme that provides anonymity for both senders and receivers while adhering to low bounds of delay, communication and bandwidth overheads. The design offers resistance against various attacks including a coalition of malicious peers. It has inherited scalability and fault tolerance and is applicable for various interactive P2P services.
Index Terms:
Anonymity, Distributed Hash Table (DHT), Interactive Services, Low-latency, Peer-to-Peer (P2P)
Citation:
Sharon Shitrit, Eyal Felstaine, Niv Gilboa, Ofer Hermoni, "Anonymity Scheme for Interactive P2P Services," ccgrid, pp.33-40, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID), 2008
Usage of this product signifies your acceptance of the Terms of Use.