TY - GEN
T1 - Rendezvous tunnel for anonymous publishing
T2 - 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011
AU - Hermoni, Ofer
AU - Gilboa, Niv
AU - Felstaine, Eyal
AU - Elovici, Yuval
AU - Dolev, Shlomi
N1 - Funding Information:
This research has been supported by the Ministry of Science and Technology (MOST), the Israel Internet Association (ISOC-IL), the Lynne and William Frankel Center for Computer Science at Ben-Gurion University, Rita Altura Trust Chair in Computer Science, the ICT Programme of the European Union under contract number FP7-215270 (FRONTS), Microsoft, US Air-Force, Israel Science Foundation (grant number 428/11), Verisign 25th Anniversary of .COM grant and Deutsche Telekom Labs at BGU. A poster presenting preliminary results of this work was presented in CCS ’10 [13].
PY - 2011/10/21
Y1 - 2011/10/21
N2 - Anonymous communication, and in particular anonymous Peer-to-Peer (P2P) file sharing systems, have received considerable attention in recent years. In a P2P file sharing system, there are three types of participants: publishers that insert content into the system, servers that store content, and readers that retrieve content from the servers. Existing anonymous P2P file sharing systems confer partial anonymity. They provide anonymity to participant pairs, such as servers and readers or publishers and readers, but they do not consider the anonymity of all three types of participants. In this work we propose two solutions for anonymous P2P file sharing systems. Both of our solutions provide anonymity to all three types of participants. The proposed solutions are based on indexing by global hash functions (rather than an index server), dispersal of information, and three anonymity tunnels. Each anonymity tunnel is designed to protect the anonymity of a different user (publisher, server, or reader). In both solutions the reader and publisher tunnels are sender anonymity tunnels. In the first solution the third tunnel is a rendezvous tunnel, constructed by means of a random walk and terminating at the server. In the second solution, which is based on Tor, the third tunnel is built using Tor's hidden services. The first solution preserves anonymity in the presence of a semi-honest adversary that controls a limited number of nodes in the system. The second solution is based on Tor primitives, coping with the same adversary as that assumed in Tor. The second solution enhances Tor, ensuring publisher, server, and reader anonymity.
AB - Anonymous communication, and in particular anonymous Peer-to-Peer (P2P) file sharing systems, have received considerable attention in recent years. In a P2P file sharing system, there are three types of participants: publishers that insert content into the system, servers that store content, and readers that retrieve content from the servers. Existing anonymous P2P file sharing systems confer partial anonymity. They provide anonymity to participant pairs, such as servers and readers or publishers and readers, but they do not consider the anonymity of all three types of participants. In this work we propose two solutions for anonymous P2P file sharing systems. Both of our solutions provide anonymity to all three types of participants. The proposed solutions are based on indexing by global hash functions (rather than an index server), dispersal of information, and three anonymity tunnels. Each anonymity tunnel is designed to protect the anonymity of a different user (publisher, server, or reader). In both solutions the reader and publisher tunnels are sender anonymity tunnels. In the first solution the third tunnel is a rendezvous tunnel, constructed by means of a random walk and terminating at the server. In the second solution, which is based on Tor, the third tunnel is built using Tor's hidden services. The first solution preserves anonymity in the presence of a semi-honest adversary that controls a limited number of nodes in the system. The second solution is based on Tor primitives, coping with the same adversary as that assumed in Tor. The second solution enhances Tor, ensuring publisher, server, and reader anonymity.
UR - http://www.scopus.com/inward/record.url?scp=80054701767&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24550-3_18
DO - 10.1007/978-3-642-24550-3_18
M3 - Conference contribution
AN - SCOPUS:80054701767
SN - 9783642245497
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 223
EP - 237
BT - Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Proceedings
Y2 - 10 October 2011 through 12 October 2011
ER -