TY - GEN
T1 - Rendezvous tunnel for anonymous publishing
AU - Hermoni, Ofer
AU - Gilboa, Niv
AU - Felstaine, Eyal
AU - Elovici, Yuval
AU - Dolev, Shlomi
PY - 2010/12/16
Y1 - 2010/12/16
N2 - Many anonymous peer-to-peer (P2P) File sharing systems have been proposed in recent years. One problem that re-mains open is how to protect the anonymity of all partici-pating users, namely, reader, server and publisher. In this work we propose a novel solution for a P2P file sharing sys-tem. Our solution provides overall anonymity to all participating users. Servers in our system store shares of documents, and each share is reached through a rendezvous tunnel between the server and an address given by a hash of the document's name. To publish a document, the publisher first divides the document into shares, for each share finds the address of the entrance to the tunnel by hashing the document's name. Next, the publisher uses anonymous communication to reach the entrance of the rendezvous tunnel. We then use a random walk and an anonymous key exchange scheme to set keys along the rendezvous tunnel. The publisher finishes by inserting the shares into the servers through the ren-dezvous tunnels. A reader wanting to retrieve the document operates in a similar manner. The reader finds the address of the entrance to the rendezvous tunnels by hashing the document's name. Then, the reader uses anonymous com-munication to reach the entrance of the tunnels, retrieves the shares anonymously and reconstructs the document. The novelty of this work is threefold. First, we introduce an anonymous key exchange protocol secure against an hon-est but curious adversary. The anonymity of the protocol is proved on the basis of the Decisional Diffie Hellman (DDH) problem. Second, we propose two solutions to build the ren-dezvous tunnel: basic and advanced. The basic solution is straightforward, while the advanced solution is based on the key exchange protocol. In the advanced solution, the key exchange is done between the publisher and each user along the rendezvous tunnel. Third, the rendezvous tunnel is used as a building block for an anonymous P2P file sharing sys-tem that provides anonymity to all participating users.
AB - Many anonymous peer-to-peer (P2P) File sharing systems have been proposed in recent years. One problem that re-mains open is how to protect the anonymity of all partici-pating users, namely, reader, server and publisher. In this work we propose a novel solution for a P2P file sharing sys-tem. Our solution provides overall anonymity to all participating users. Servers in our system store shares of documents, and each share is reached through a rendezvous tunnel between the server and an address given by a hash of the document's name. To publish a document, the publisher first divides the document into shares, for each share finds the address of the entrance to the tunnel by hashing the document's name. Next, the publisher uses anonymous communication to reach the entrance of the rendezvous tunnel. We then use a random walk and an anonymous key exchange scheme to set keys along the rendezvous tunnel. The publisher finishes by inserting the shares into the servers through the ren-dezvous tunnels. A reader wanting to retrieve the document operates in a similar manner. The reader finds the address of the entrance to the rendezvous tunnels by hashing the document's name. Then, the reader uses anonymous com-munication to reach the entrance of the tunnels, retrieves the shares anonymously and reconstructs the document. The novelty of this work is threefold. First, we introduce an anonymous key exchange protocol secure against an hon-est but curious adversary. The anonymity of the protocol is proved on the basis of the Decisional Diffie Hellman (DDH) problem. Second, we propose two solutions to build the ren-dezvous tunnel: basic and advanced. The basic solution is straightforward, while the advanced solution is based on the key exchange protocol. In the advanced solution, the key exchange is done between the publisher and each user along the rendezvous tunnel. Third, the rendezvous tunnel is used as a building block for an anonymous P2P file sharing sys-tem that provides anonymity to all participating users.
KW - Anonymity
KW - Peer-to-peer networks
KW - Publisher anonymity
UR - http://www.scopus.com/inward/record.url?scp=78650012957&partnerID=8YFLogxK
U2 - 10.1145/1866307.1866399
DO - 10.1145/1866307.1866399
M3 - Conference contribution
AN - SCOPUS:78650012957
SN - 9781450302449
T3 - Proceedings of the ACM Conference on Computer and Communications Security
SP - 690
EP - 692
BT - CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security
T2 - 17th ACM Conference on Computer and Communications Security, CCS'10
Y2 - 4 October 2010 through 8 October 2010
ER -