Publications de Jean-Pierre Hubaux

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.

Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must be deployed carefully in the network to reduce the cost they induce on mobile users an ...

While extensive work has been carried out with the goal of validating the TINA architecture and the TINA documents, little has been done yet for the validation of TINA services. This is the main focus of the ErnesTINA project. In the ErnesTINA project, we propose an integrated approach to facilitate the validation of TINA services by verifying at run-time that the service implementation has not violated and is not violating certain predefined properties. In this paper, we present the specification of the pr

We propose an object-oriented specification language, FUS , for expressing the functional behaviors and the desired properties of each telecommunications service at the analysis phase. Our approach is based on Fusion, an object-oriented method that consists of analysis, design, and implementation phases for software development. Accompanying FUS is a tool we developed for translating FUS specifications to Promela statements

In this paper, we provide a formal analysis of a rational exchange protocol proposed by Syverson. A rational exchange protocol guarantees that misbehavior cannot generate benefits, and is therefore discouraged. The analysis is performed using our formal model, which is based on game theory. In this model, rational exchange is defined in terms of a Nash equilibrium.

Road safety, traffic management, and driver convenience continue to improve, in large part thanks to appropriate usage of information technology. But this evolution has deep implications for security and privacy, which the research community has overlooked so far.

Improving network lifetime is an important issue involved in every aspect of the design and deployment of wireless sensor networks. There is a recent research trend of studying the application of a mobile sink to transport (rather than let the sensor nodes transmit) data back. Whereas this approach trades data delivery latency for reduced (node) energy consumption (and thus an improved lifetime), our experience tells us that sacrificing latency to extend lifetime is not necessary. In this paper, in line wit

In this paper we consider the problem of node positioning in ad-hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on Global Positioning System (GPS). The algorithm uses the distances between the nodes to build a relative coordinate system in which the node positions are computed in two dimensions. The main contribution of this work is to define and compute relative positions of the nodes in an ad-hoc network without using GPS. We further explain how the pro

Location-awareness is crucial to many applications of sensor networks. Existing location surveying approaches either rely on an inflexible infrastructure or suffer from high computation and communication load. In this paper, we present Non-intEractive lOca ...

Secure storage of genomic data is of great and increasing importance. The scientific community's improving ability to interpret individuals' genetic materials and the growing size of genetic database populations have been aggravating the potential conseque ...

In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have proposed to introduce an incentive mechanism in the network that motivates the nodes to cooperate. In this paper, we address the question of whether such an incentive mechanism is necessary or cooperation between the nodes exists in the absence of it. We define a

Impulse Radio Ultra-Wideband, in particular the recent standard IEEE 802.15.4a, is a primary candidate for implementing distance bounding protocols, thanks to its ability to perform accurate indoor ranging. Distance bounding protocols allow two wireless de ...

In this paper, we propose privacy-enhancing technologies for medical tests and personalized medicine methods that use patients' genomic data. Focusing on genetic disease-susceptibility tests, we develop a new architecture (between the patient and the medic ...

A fair exchange protocol is a protocol, in which two (or more) mutually suspicious parties exchange their digital items in a way that neither party can gain an advantage over the other by misbehaving. Many fair exchange protocols have been proposed in the academic literature, but they provide rather different types of fairness. The formal comparison of these proposals remained diffcult, mainly, because of the lack of a common formal framework, in which each can be modelled and formal fairness defnitions can

The behavior of a given wireless station may affect the communication capabilities of a neighboring one, notably because the radio communication channel is usually shared in wireless networks. In this tutorial, we carefully explain how situations of this kind can be modelled by making use of game theory. By leveraging on four simple running examples, we introduce the most fundamental concepts of non-cooperative game theory. This approach should help students and scholars to quickly master this fascinating a

Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc networks have sufficiently redundant paths and counter-DoS mechanisms to make DoS attacks largely ineffective? Or are there attack and system factors that can lead to devastating effects? In this paper, we design and study DoS attacks in order to assess the damage that difficultto- detect attackers can cause. The first attack we study

This paper investigates the performance of AAL5 under cell loss conditions for real-time MPEG-2 based video applications. The figures derived through simulations show poor performance due to AAL5 limited error correction methods. The results motivate the introduction of new AAL mechanisms suited for CBR multimedia applications that integrates per-cell sequence numbering without adding any extra overhead. This mechansim increases the error detection granularity. The results show an improvement on the cell lo

Geneticists prefer to store patients’ aligned, raw genomic data, in addition to their variant calls (compact and summarized form of the raw data), mainly because of the immaturity of bioinformatic algorithms and sequencing platforms. Thus, we propose a pri ...

Botnets are a serious threat on the Internet and require huge resources to be thwarted. ISPs are in the best position to fight botnets and there are a number of recently proposed initiatives that focus on how ISPs should detect and remediate bots. However, ...

Jean-Pierre Hubaux

Chattez avec Graph Search

Tracking Games in Mobile Networks

TINA Service Validation: The ErnesTINA Project

TINA Service Validation: The ErnesTINA project

Service Specification and Validation for the Intelligent Network

A Formal Analysis of Syverson`s Rational Exchange Protocol

The Security and Privacy of Smart Vehicles

MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks

GPS-free Positioning in Mobile Ad-Hoc Networks

Non-Interactive Location Surveying for Sensor Networks with Mobility-Differentiated ToA

GenoGuard: Protecting Genomic Data against Brute-Force Attacks

Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - the Static Case

Distance Bounding with IEEE 802.15.4a: Attacks and Countermeasures

Protecting and Evaluating Genomic Privacy in Medical Tests and Personalized Medicine

Toward a Formal Model of Fair Exchange, a Game Theoretic Approach

Game Theory in Wireless Networks: A Tutorial

Denial of Service Resilience in Ad Hoc Networks

MobiRoute: Routing towards a Mobile Sink for Improving Lifetime in Sensor Networks

Study of AAL5 and a New AAL Segmentation Mechanism for MPEG-2 Video over ATM

Privacy-Preserving Processing of Raw Genomic Data

ISPs and Ad Networks Against Botnet Ad Fraud