TY - GEN
T1 - Anonymity scheme for interactive P2P services
AU - Shitrit, Sharon
AU - Felstaine, Eyal
AU - Gilboa, Niv
AU - Hermoni, Ofer
PY - 2008/9/5
Y1 - 2008/9/5
N2 - 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
AB - 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
UR - http://www.scopus.com/inward/record.url?scp=50649097278&partnerID=8YFLogxK
U2 - 10.1109/CCGRID.2008.54
DO - 10.1109/CCGRID.2008.54
M3 - Conference contribution
AN - SCOPUS:50649097278
SN - 9780769531564
T3 - Proceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid
SP - 33
EP - 40
BT - Proceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid
T2 - CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid
Y2 - 19 May 2008 through 22 May 2008
ER -