Publication

Mobility Helps Peer-to-Peer Security

Publications associées (53)

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

Automatic Verification of Temporal-Epistemic Properties of Cryptographic Protocols

We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and r ...

2009

Cryptanalysis of e-mail protocols providing perfect forward secrecy

Recently, two e-mail protocols were proposed claiming to provide perfect secrecy. These protocols use authentication and (Diffie-Hellman) key-exchange techniques, and as such, other standard security criteria besides perfect forward secrecy include key-rep ...

2008

Theory and tool support for the formal verification of cryptographic protocols

Sébastien Briais

Cryptographic protocols are an essential component of network communications. Despite their relatively small size compared to other distributed algorithms, they are known to be error-prone. This is due to the obligation to behave robustly in the context of ...

EPFL2008

Mobility Helps Peer-to-Peer Security

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a straightforward technique to provide peer-to-peer security in mobile networks. We show that far from being a hurdle, mobility can be exploited to set up security associations among users. We leverage on the temporary vicinity of users, during ...

2006

On Bluetooth repairing: key agreement based on symmetric-key cryptography

Serge Vaudenay

Despite many good (secure) key agreement protocols based on public-key cryptography exist, secure associations between two wireless devices are often established using symmetric-key cryptography for cost reasons. The consequence is that common daily used s ...

2005

A Formal Semantics For Protocol Narrations

Sébastien Briais

Protocol narrations are an informal means to describe, in an idealistic manner, the functioning of cryptographic protocols as a single intended sequence of cryptographic message exchanges among the protocol's participants. Protocol narrations have also bee ...

2005

Location verification and key management in wireless networks

Srdan Capkun

This thesis is primarily concerned with two security mechanisms for wireless networks: location verification and key management. These mechanisms are potential building blocks in the security architectures of a range of applications. Under location verific ...

EPFL2004

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

A Charging and Rewarding Scheme for Packet Forwarding

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

In multi-hop cellular networks, data packets have to be relayed hop by hop from a given mobile station to a base station and vice-versa. This means that the mobile stations must accept to forward information for the benefit of other stations. In this paper ...

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