Privacy in file sharing networks

Peer-to-peer file sharing (P2P) systems like Gnutella, KaZaA, and eDonkey/eMule, have become extremely popular in recent years, with the estimated user population in the millions. An academic research paper analyzed Gnutella and eMule protocols and found weaknesses in the protocol; many of the issues found in these networks are fundamental and probably common on other P2P networks.^[1] Users of file sharing networks, such as eMule and Gnutella, are subject to monitoring of their activity. Clients may be tracked by IP address, DNS name, software version they use, files they share, queries they initiate, and queries they answer to.^[1] Clients may also share their private files to the network without notice due to inappropriate settings.^[2]

Much is known about the network structure, routing schemes, performance load and fault tolerance of P2P systems in general.^[3] It might be surprising, but the eMule protocol does not provide much privacy to the users, although it is a P2P protocol which is supposed to be decentralized.^[4]

The Gnutella and eMule protocols

The eMule protocol

eMule is one of the clients which implements the eDonkey network. The eMule protocol consists of more than 75 types of messages. When an eMule client connects to the network, it first gets a list of known eMule servers which can be obtained from the Internet. Despite the fact that there are millions of eMule clients, there are only small amount of servers.^[5]^[6] The client connects to a server with TCP connection. That stays open as long as the client is connected to the network. Upon connecting, the client sends a list of its shared files to the server. By this the server builds a database with the files that reside on this client.^[7] The server also returns a list of other known servers. The server returns an ID to the client, which is a unique client identifier within the system. The server can only generate query replies to clients which are directly connected to it. The download is done by dividing the file into parts and asking each client a part.^{[citation needed]}

The Gnutella protocol

Gnutella protocol v0.4

In Gnutella protocol V0.4 all the nodes are identical, and every node may choose to connect to every other.^[8] The Gnutella protocol consist of 5 message types: query for tile search. Query messages use a flooding mechanism, i.e. each node that receives a query forwards it on all of its adjacent graph node links.^[9] A node that receives a query and has the appropriate file replies with a query hit message. A hop count field in the header limits the message lifetime.^{[citation needed]} Ping and Pong messages are used for detecting new nodes that can be linked to the actual file download performed by opening TCP connection and using the HTTP GET mechanism.^[10]^[11]

Gnutella protocol v0.6

Gnutella protocol V0.6 includes several modifications: A node has one of two operational modes: "leaf node" or "ultrapeer".^{[citation needed]} Initially each node starts in a leaf node mode in which it can only connect to ultrapeers. The leaf nodes send query to an ultrapeer, the ultrapeer forwards the query and waits for the replies. When a node has enough bandwidth and uptime, the node may become an ultrapeer.^{[citation needed]} Ultrapeers send periodically a request for their clients to send a list with the shared files they have. If a query arrives with a search string that matches one of the files in the leaves, the ultrapeer replies and pointing to the specific leaf.^{[citation needed]}

Tracking initiators and responders

In version 0.4 of the Gnutella protocol, an ultrapeer which receives a message from a leaf node (message with hop count zero) knows for sure that the message was originated from that leaf node.^{[citation needed]}

In version 0.6 of the protocol, If an ultrapeer receives a message from an ultrapeer with hop count zero then it knows that the message originated by the ultrapeer or by one of its leaves (The average number of the leaves nodes that are connected to an ultrapeer is 200).^{[citation needed]}

Tracking a single node

Many clients of Gnutella have an HTTP monitor feature. This feature allows sending information about the node to any node which supports an empty HTTP request, and receiving on response.^{[citation needed]} Research shows that a simple crawler which is connected to Gnutella network can get from an initial entry point a list of IP addresses which are connected to that entry point.^{[citation needed]} Then the crawler can continue to inquire for other IP addresses. An academic research performed the following experiment: At NYU, a regular Gnucleus software client that was connected to the Gnutella network as a leaf node, with distinctive listening TCP port 44121. At the Hebrew University, Jerusalem, Israel, a crawler ran looking for client listening with port 44121. In less than 15 minutes the crawler found the IP address of the Gnucleus client in NYU with the unique port.^{[citation needed]}

IP address harvesting

If a user is connected to the Gnutella network within, say, the last 24 hours, that user's IP address can be easily harvested by hackers, since the HTTP monitoring feature can collect about 300,000 unique addresses within 10 hours.^{[citation needed]}

Tracking nodes by GUID creation

A Globally unique identifier (GUID) is a 16 bytes field in the Gnutella message header, which uniquely identifies every Gnutella message. The protocol does not specify how to generate the GUID.^{[citation needed]}

Gnucleus on Windows uses the Ethernet MAC address used as the GUID 6 lower bytes. Therefore, Windows clients reveal their MAC address when sending queries.^[12]

In the JTella 0.7 client software the GUID is created using the Java random number without an initialization. Therefore, on each session, the client creates a sequence of queries with the same repeating IDs. Over time, a correlation between the user queries can be found.^{[citation needed]}

Collecting miscellaneous information users

The monitoring facility of Gnutella reveals an abundance of precious information on its users. It is possible to collect the information about the software vendor and the version that the clients use. Other statistical information about the client is available as well: capacity, uptime, local files etc.^{[citation needed]}

In Gnutella V0.6, information about client software can be collected (even if the client does not support HTTP monitoring). The information is found in the first two messages connection handshake.^{[citation needed]}

Tracking users by partial information

Some Gnutella users have a small look-alike set, which makes it easier to track them by knowing this very partial information.^{[citation needed]}

Tracking users by queries

An academic research team performed the following experiment: the team ran five Gnutella as ultrapeer (in order to listen to other nodes’ queries). The team revealed about 6% of the queries.^{[citation needed]}

Usage of hash functions

SHA-1 hashes refer to SHA-1 of files not search strings.

Half of the search queries are strings and half of them are the output of a hash function (SHA-1) applied on the string. Although the usage of hash function is intended to improve the privacy, an academic research showed that the query content can be exposed easily by a dictionary attack: collaborators ultrapeers can gradually collect common search strings, calculate their hash value and store them into a dictionary. When a hashed query arrives, each collaborated ultrapeer can check matches with the dictionary and expose the original string accordingly.^{[citation needed]}^[13]

Measures

A common countermeasure used is concealing a user's IP address when downloading or uploading content by using anonymous networks, such as I2P - The Anonymous Network. There is also data encryption and the use of indirect connections (mix networks) to exchange data between peers.^{[citation needed]} Thus all traffic is anonymized and encrypted. Unfortunately, anonymity and safety come at the price of much lower speeds, and due to the nature of those networks being internal networks there currently still is less content. However, this will change, once there are more users.^{[citation needed]}

References

^ ^a ^b Bickson, Danny; Malkhi, Dahlia (2004). "A Study of Privacy in File Sharing Networks". Archived from the original on 12 October 2013. Retrieved 12 February 2013.{{cite web}}: CS1 maint: bot: original URL status unknown (link)
^ Liu, Bingshuang; Liu, Zhaoyang; Zhang, Jianyu; Wei, Tao; Zou, Wei (2012-10-15). "How many eyes are spying on your shared folders?". Proceedings of the 2012 ACM workshop on Privacy in the electronic society. WPES '12. Raleigh, North Carolina, USA: Association for Computing Machinery. pp. 109–116. doi:10.1145/2381966.2381982. ISBN 978-1-4503-1663-7. S2CID 13840840.
^ Eng Keong Lua Jon Crowcroft. "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes". IEEE Communications Surveys & Tutorials. 7 (2): 72–93.
^ Silva, Pedro Moreira da (19 June 2017). "Mistrustful P2P: Deterministic privacy-preserving P2P file sharing model to hide user content interests in untrusted peer-to-peer networks". Computer Networks. 120: 87–104. doi:10.1016/j.comnet.2017.04.005.
^ "Top Project Listings". sourceforge.net. Retrieved 2021-09-18.
^ "Safe Server List for eMule. Generated: September 17 2021 18:28:20 UTC+3". www.emule-security.org. Retrieved 2021-09-18.
^ Yoram Kulbak and Danny Bickson. "The eMule protocol specification". EMule Project.
^ "privacy in file sharing". inba.info. Retrieved 2020-10-23.
^ Yingwu Zhu; Yiming Hu (2006-12-01). "Enhancing Search Performance on Gnutella-Like P2P Systems". IEEE Transactions on Parallel and Distributed Systems. 17 (12): 1482–1495. doi:10.1109/tpds.2006.173. ISSN 1045-9219. S2CID 496918.
^ "Gnutella Protocol Development". rfc-gnutella.sourceforge.net. Retrieved 2020-11-12.
^ "Tornado Cash". Retrieved 24 September 2023.
^ Courtney, Kylan. (2012). Information and internet privacy handbook. Murdock, Keon. (1st ed.). Delhi [India]: College Publishing House. ISBN 978-81-323-1280-2. OCLC 789644329.
^ Zink, Thomas (October 2020). "Analysis and Efficient Classification of P2P File Sharing Traffic". Universität Konstanz.

External links

eMule project Official website
eMule on SourceForge (SourceForge) Contains archives of past versions of eMule
List of allowed eMule-Mods

[:0-1] Bickson, Danny; Malkhi, Dahlia (2004). "A Study of Privacy in File Sharing Networks". Archived from the original on 12 October 2013. Retrieved 12 February 2013.{{cite web}}: CS1 maint: bot: original URL status unknown (link)

[2] Liu, Bingshuang; Liu, Zhaoyang; Zhang, Jianyu; Wei, Tao; Zou, Wei (2012-10-15). "How many eyes are spying on your shared folders?". Proceedings of the 2012 ACM workshop on Privacy in the electronic society. WPES '12. Raleigh, North Carolina, USA: Association for Computing Machinery. pp. 109–116. doi:10.1145/2381966.2381982. ISBN 978-1-4503-1663-7. S2CID 13840840.

[3] Eng Keong Lua Jon Crowcroft. "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes". IEEE Communications Surveys & Tutorials. 7 (2): 72–93.

[4] Silva, Pedro Moreira da (19 June 2017). "Mistrustful P2P: Deterministic privacy-preserving P2P file sharing model to hide user content interests in untrusted peer-to-peer networks". Computer Networks. 120: 87–104. doi:10.1016/j.comnet.2017.04.005.

[5] "Top Project Listings". sourceforge.net. Retrieved 2021-09-18.

[6] "Safe Server List for eMule. Generated: September 17 2021 18:28:20 UTC+3". www.emule-security.org. Retrieved 2021-09-18.

[7] Yoram Kulbak and Danny Bickson. "The eMule protocol specification". EMule Project.

[8] "privacy in file sharing". inba.info. Retrieved 2020-10-23.

[9] Yingwu Zhu; Yiming Hu (2006-12-01). "Enhancing Search Performance on Gnutella-Like P2P Systems". IEEE Transactions on Parallel and Distributed Systems. 17 (12): 1482–1495. doi:10.1109/tpds.2006.173. ISSN 1045-9219. S2CID 496918.

[10] "Gnutella Protocol Development". rfc-gnutella.sourceforge.net. Retrieved 2020-11-12.

[11] "Tornado Cash". Retrieved 24 September 2023.

[12] Courtney, Kylan. (2012). Information and internet privacy handbook. Murdock, Keon. (1st ed.). Delhi [India]: College Publishing House. ISBN 978-81-323-1280-2. OCLC 789644329.

[13] Zink, Thomas (October 2020). "Analysis and Efficient Classification of P2P File Sharing Traffic". Universität Konstanz.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]