Personne

Srdan Capkun

Publications associées (31)

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

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price charged by the cellular network operators is too high. In this paper, we explain that ther ...

2004

Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

We present a scheme for secure and privacy-preserving communication in hybrid ad hoc networks. Our scheme enables users to secure communication and to protect their anonymity and location privacy. Our approach is based on frequently changing node pseudonym ...

2004

Securing position and distance verification in wireless networks

Jean-Pierre Hubaux, Srdan Capkun

So far, the problem of positioning and distance measurements in wireless networks has been studied in a non-adversarial setting. In this work, we analyze the resistance of positioning techniques to position and distance modification attacks; we propose two ...

2004

So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...

2004

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price cellular network operators charge for it is too high. In this paper, we explain that there ...

2004

A Formal Model of Rational Exchange and Its Application to the Analysis of Syverson's Protocol

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a formal model of rational exchange and exchange protocols in general, which is based on game theory. In this model, an exchange protocol is represented as a set of strategies in a game that is played by the protocol parties and the network that ...

2004

, ,

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 ...

2004

Self-organized public-key management for mobile ad hoc networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In contrast with conventional networks, mobile ad hoc networks usually do not provide on-line access to trusted authorities or to centralized servers and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reaso ...

2003

Mobility Helps Security in Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We propose a technique in which security associations between nodes are establi ...

2003

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

Jean-Pierre Hubaux, Srdan Capkun

We investigate secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes. We focus on source routing protocols. We show that to establish secure routes, it is in general not necessary that security a ...

2003