4P: Performant private peer-to-peer file sharing

  title={4P: Performant private peer-to-peer file sharing},
  author={Niels Zeilemaker and Johan A. Pouwelse and Henk J. Sips},
  journal={14-th IEEE International Conference on Peer-to-Peer Computing},
In recent years fully decentralized file sharing systems were developed aimed at improving anonymity among their users. These systems provide typical file sharing features such as searching for and downloading files. However, elaborate schemes originally aimed at improving anonymity cause partial keyword matching to be virtually impossible, or introduce a substantial bandwidth overhead. In this paper we introduce 4P, a system that provides users with anonymous search on top of a semantic… 

Figures and Tables from this paper

Privacy and Cooperation in Peer-to-Peer Systems

This thesis looks at other forms of collaboration wherein a P2P system can overcome some of the other downsides of centralized solutions, e.g. the privacy concerns.

Freeweb: P2P-Assisted Collaborative Censorship-Resistant Web Browsing

An open-sourced Freeweb, which relies on widely-distributed peer-to-peer (P2P) nodes in a decentralized manner rather than specified proxies in a centralized manner, and its enhancement reduces much network load and file access latency, and avoids node overloads.



Load reduction in the KAD peer-to-peer system

This paper designs and implements Mistral, a content spy that can capture up to ten million references to published content in several hours and proposes to add a stopword filtering mechanism to the search and publish procedures of kad-based peer-to-peer systems.

Epidemic-Style Management of Semantic Overlays for Content-Based Searching

This paper proposes a proactive method to build a semantic overlay based on an epidemic protocol that clusters peers with similar content, and is worth noting that this peer clustering is done in a completely implicit way, that is, without requiring the user to specify his preferences or to characterize the content of files he shares.

Freenet: A Distributed Anonymous Information Storage and Retrieval System

We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet

Peer-to-Peer Streaming Peer Protocol (PPSPP)

The Peer-to-Peer Streaming Peer Protocol (PPSPP) is a protocol for disseminating the same content to a group of interested parties in a streaming fashion. PPSPP supports streaming of both prerecorded

Anonymous Web transactions with Crowds

The thesis is Web users should have the ability to limit what information is revealed about them and to whom it is revealed.

An Encoding for Censorship-Resistant Sharing

The proposed ECRS supports both efficient dissemination of encrypted data as well as encrypted queries over this data, and allows users to share files encrypted under descriptive keys which are the basis for querying the network for content.

Large-scale message synchronization in challenged networks

It is shown, through extensive experimental evidence that peers have no difficulties in synchronizing over 100,000 messages, and a NAT traversal technique able to puncture 77% of NAT-firewalls is integrated in Dispersy.

Survey on Anonymity in Unstructured Peer-to-Peer Systems

  • Renyi Xiao
  • Computer Science
    Journal of Computer Science and Technology
  • 2008
The properties of unstructured P2P anonymity are investigated, and current attack models on these designs are summarized, to discuss the open problems in this field and propose several future research directions.

Tribler: P2P media search and sharing

Tribler is an open-source software project facilitating search, streaming and sharing content using P2P technology, resulting in sub-second content search, a reputation system for rewarding upload, and channels for content publishing and spam prevention.

Building a privacy-preserving semantic overlay for Peer-to-Peer networks

Searching a Peer-to-Peer (P2P) network without using a central index has been widely investigated but proved to be very difficult. Various strategies have been proposed, however no practical solution