Title :
Anonymity Scheme for Interactive P2P Services
Author :
Shitrit, Sharon ; Felstaine, Eyal ; Gilboa, Niv ; Hermoni, Ofer
Author_Institution :
Dept. of Inf. Syst. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva
Abstract :
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 a comparatively 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.
Keywords :
cryptography; fault tolerance; peer-to-peer computing; telecommunication security; anonymity scheme; encryption scheme; fault tolerance; interactive P2P services; low-latency P2P scheme; peer-to-peer applications; structured overlay network; Authentication; Bandwidth; Cryptography; Delay; Grid computing; Information systems; Peer to peer computing; Protection; Systems engineering and theory; Web and internet services; Anonymity; Distributed Hash Table (DHT); Interactive Services; Low-latency; Peer-to-Peer (P2P);
Conference_Titel :
Cluster Computing and the Grid, 2008. CCGRID '08. 8th IEEE International Symposium on
Conference_Location :
Lyon
Print_ISBN :
978-0-7695-3156-4
Electronic_ISBN :
978-0-7695-3156-4
DOI :
10.1109/CCGRID.2008.54