Concept

Logiciel malveillant

Publications associées (77)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Malicious Users in Unstructured Networks

Georgios Theodorakopoulos

Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow the network protocol or not. While providing scalability benefits, this degrade ...

2007

Challenges in Remote Laboratory Sustainability

Denis Gillet, Christophe Salzmann

Remote experimentation facilities have been accessible from the Internet for more than a decade. However, sustainability of such services is not adequately ensured in many academic institutions. The major challenge lies in moving from a single research set ...

2007

Vulnerabilities in Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

We identify vulnerabilities in epidemic forwarding. We address broadcast applications over wireless ad-hoc networks. Epidemic forwarding employs several mechanisms such as inhibition and spread control, and each of them can be implemented using alternative ...

2007

Secure incentives to cooperate for wireless networks

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007

Optimal Scheduling of Peer-to-Peer File Dissemination

Jochen Mundinger

Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then ...

2007

Forensic Automatic Speaker Recognition

Andrzej Drygajlo

The existence of highly developed and fully automated telephone networks in industrialized countries and the pervasiveness of speech communication technology have resulted in the ever-increasing use of the human voice as an instrument in the commission of ...

2007

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Rachid Guerraoui, Seth Gilbert

How efficiently can a malicious device disrupt a single-hop wireless network? Imagine two honest players attempting to exchange information in the presence of a malicious adversary that can disrupt communication by jamming or overwriting messages. Assume t ...

2006

Vulnerabilities in Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

We identify vulnerabilities in epidemic forwarding. We address broadcast applications over wireless ad-hoc networks. Epidemic forwarding employs several mechanisms such as inhibition and spread control and each of them can be achieved using different alter ...

2006

Of Malicious Motes and Suspicious Sensors

Rachid Guerraoui, Seth Gilbert

How efficiently can a malicious device disrupt communication in a wireless network? Imagine a basic game involving two honest players, Alice and Bob, who want to exchange information, and an adversary, Collin, who can disrupt communication using a limited ...

2006