Comparing paedophile activity in different P2P systems

Peer-to-peer (P2P) systems are widely used to exchange content over the Internet. Knowledge on paedophile activity in such networks remains limited while it has important social consequences. Moreover, though there are different P2P systems in use, previous academic works on this topic focused on one system at a time and their results are not directly comparable. We design a methodology for comparing \kad and \edonkey, two P2P systems among the most prominent ones and with different anonymity levels. We monitor two \edonkey servers and the \kad network during several days and record hundreds of thousands of keyword-based queries. We detect paedophile-related queries with a previously validated tool and we propose, for the first time, a large-scale comparison of paedophile activity in two different P2P systems. We conclude that there are significantly fewer paedophile queries in \kad than in \edonkey (approximately 0.09% \vs 0.25%).Comment: Submitte

IP Multicast Security

Support de cours.With emerging of new cooperative applications, the group communication is clearly become a very important concept within the network architecture. The multicast transmission is appeared as the most efficient way to send some data to a specific group composed of several participants like used in multimedia applications (audio and video conferences, video diffusion,...) But today, we can see that commercial multicast deployment is not a reality yet. This model presents some limits such as: scalable routing problems, address allocation problems and mainly security issues because any host can send data to IP multicast address and any host can join Nowadays the increasing interest in network communication through the using of the Internet requires some services such as authentication, integrity and confidentiality to transport securely data. The lack of security in multicast communications is essentially due to the difficulty to develop solutions which are efficient and fault tolerant. In our tutorial, we present : * Security issues within group communications and why the approaches to secure the unicast communications cannot be directly applied to group communications. * Research work related to key management and key distribution. * Research work related to source authentication. * Fault tolerance within group communications

Fighting against paedophile activities in the KAD P2P network

International audienceIn this short paper, we present a solution to fight against paedophile activities in KAD. Our distributed architecture can monitor and act on paedophile contents in a very efficient way by controlling keywords and files. Early results on the real network demonstrate the applicability of our approach

Green Growth in NDN: Deployment of Content Stores

International audienceNamed-Data Networking architecture relies on cache networks, where nodes store the data for further requests. However, the memory needed at each node called Content Store represents the most significant part of the entire cost of the infrastructure that has to be supported by network providers, making difficult the change from the current Internet infrastructure to a Future Internet based on NDN. Thus, a legitimate question would be: "are all these Content Stores useful in a large-scale NDN network?" In this paper, we investigate theimpact of Content Stores in NDN network, and we evaluate the performances of the NDN architecture according to the number of Content Stores effectively deployed in the network. We show through extensive simulation experiments in NS-3 that only about 50% of nodes with Content Stores is enough to achieve higher level of performances than a fully-deployed NDN network. This result is very important for the deployment of NDN architecture as it shows that the infrastructure cost can be drastically reduced and it is an incentive for network providers that benefits directly from this result

Testing Nearby Peer-to-Peer Mobile Apps at Large

International audienceWhile mobile devices are widely adopted across the population, most of their remote interactions usually go through Internet. However, this indirect interaction model can be assumed as inefficient and sensitive when considering communications with neighboring devices. To leverage such weaknesses, nearby peer-to-peer(P2P) communications are now included in mobile devices to enable device-to-device communications over standard wireless technologies (WiFi, Bluetooth). While this capability supports the design of collaborative whiteboards, local multiplayer gaming, multi-screen gaming, offline file transfers and many other applications, mobile apps using P2P are still suffering from app crashes, battery issues, and bad user reviews and ranking in app stores. We believe that this lack of quality can be partly attributed to the lack of tool support for testing P2P mobile apps at large. In this paper, we introduce a testing framework that allows developers to automate reproducible testing of nearby P2P apps. Beyond the identification of P2P-related bugs, our approach also helps to estimate the discovery settings to optimize the deployment of P2P apps

SRSC: SDN-based Routing Scheme for CCN

International audienceContent delivery such as P2P or video streaming generates the main part of the Internet traffic and Content Centric Network (CCN) appears as an appropriate architecture to satisfy the user needs. However, the lack of scalable routing scheme is one of the main obstacles that slows down a large deployment of CCN at an Internet-scale. In this paper we propose to use the Software-Defined Networking (SDN) paradigm to decouple data plane and control plane and present SRSC, a new routing scheme for CCN. Our solution is a clean-slate approach using only CCN messages and the SDN paradigm. We implemented our solution into the NS-3 simulator and perform simulations of our proposal. SRSC shows better performances than the flooding scheme used by default in CCN: it reduces the number of messages, while still improves CCN caching performances

Secure Multicasting Survey

Colloque avec actes et comité de lecture. internationale.International audienceWith emerging of new cooperative applications, the group communication is clearly become a very important concept within the network architecture. The multicast transmission is appeared as the most efficient way to send some data to a specific group composed of several members. Moreover, the increasing interest in network communication through the using of the Internet requires somes services such as authentication, integrity and confidentiality to transport securely data. In this paper we present a survey about secure multicasting. We describe the different approaches existing to distribute and manage the keys within a group. We point out how the IP multicast security deals with. We show that presently no security model meets fully the requirements needed for group communication

A Process Mining Approach for Supporting IoT Predictive Security

International audienceThe growing interest for the Internet-of-Things (IoT) is supported by the large-scale deployment of sensors and connected objects. These ones are integrated with other Internet resources in order to elaborate more complex and value-added systems and applications. While important efforts have been done for their protection, security management is a major challenge for these systems, due to their complexity, their heterogeneity and the limited resources of their devices. In this paper we introduce a process mining approach for detecting misbehaviors in such systems. It permits to characterize the behavioral models of IoT-based systems and to detect potential attacks, even in the case of heterogenous protocols and platforms. We then describe and formalize its underlying architecture and components, and detail a proof-of-concept prototype. Finally, we evaluate the performance of this solution through extensive experiments based on real industrial datasets