Concept

Logiciel malveillant

Publications associées (77)

Reputation in Self-Organized Communication Systems and Beyond (Invited Paper)

Efficiently handling reputation is important in dealing with free-riding, malicious attacks and random failures in self-organized communication systems. At the same time, work in this context is often found to be relevant in many other disciplines, in part ...

ACM2006

Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

Jean-Yves Le Boudec, Jochen Mundinger

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With o ...

2006

Analysis of peer-to-peer file dissemination

Jochen Mundinger

In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server S to a potentially large group of N end users via the Internet. A number of algorithms and protocols have been suggested, implemented ...

2006

A Protection Scheme for MoC-Enabled Smart Cards

Serge Vaudenay, Claude Barral

The concept of Match-on-Card (MoC) consists of a smart card which receives an applicant's candidate template T to be compared with the stored reference template T_ref by processing the complete matching algorithm during a biometric authentication request. ...

IEEE2006

Malware Normalization

Johannes Kinder

Malware is code designed for a malicious purpose, such as obtaining root privilege on a host. A malware detector identifies malware and thus prevents it from adversely affecting a host. In order to evade detection by malware detectors, malware writers use ...

University of Wisconsin2005

Detecting Malicious Code by Model Checking

Johannes Kinder

The ease of compiling malicious code from source code in higher programming languages has increased the volatility of malicious programs: The first appearance of a new worm in the wild is usually followed by modified versions in quick succession. As demons ...

Springer2005

Self-Policing Mobile Ad-Hoc Networks by Reputation

Jean-Yves Le Boudec, Sonja Buchegger

Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...

2005

Fuelling WiFi deployment: A reputation-based solution

Jean-Pierre Hubaux, Naouel Ben Salem

The rapid growth of WiFi over the past two years reveals the willingness of the Wireless Internet Service Providers (WISPs) to develop this technology and the interest of the users in this new service. However, the lack of unified roaming slows down the de ...

2004

Analysis of a Robust Reputation System for Self-Organized Networks

Jean-Yves Le Boudec

Self-organized networks require some mechanism to ensure cooperation and fairness in the face of individual utility maximizing users and potential malicious attacks. Otherwise, network performance can be seriously deteriorated. One promising approach are d ...

2004

Cooperation in Multi-hop Cellular Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

Naouel Ben Salem, Levente Buttyan, Jean-Pierre Hubaux and Markus Jakobsson abstract: In multi-hop cellular networks, the existence of a communication link between the mobile station and the base station is not required: a mobile station that has no direct ...

2003

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