Publication

Location verification and key management in wireless networks

Publications associées (159)

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

DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Securing ad hoc networks is notoriously challenging, notably due to the lack of an on-line infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case ...

2004

Key agreement over a radio link

Jean-Pierre Hubaux, Mario Cagalj

We present a simple, and yet powerful, technique for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol. This protocol is known to be vulnerable to the ``man-in-the-middle" attac ...

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

Reactive security for multimedia systems

Antonio Romeo

Books, videos, music, still images and any other type of media information, share a number of features that enable their migration from traditional delivery technologies to an all-electronic delivery model. They can easily be digitized, stored, compressed ...

EPFL2004

Investigation Report on Universal Multimedia Access

Touradj Ebrahimi

Universal Multimedia Access (UMA) refers to the ability to access by any user to the desired multimedia content(s) over any type of network with any device from anywhere and anytime. UMA is a key framework for multimedia content delivery service using meta ...

2004

Digital Signature Schemes with Domain Parameters

Serge Vaudenay

Digital signature schemes often use domain parameters such as prime numbers or elliptic curves. They can be subject to security threats when they are not treated like public keys. In this paper we formalize the notion of "signature scheme with domain param ...

2004

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

2003

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

Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol

Thomas Baignères

In 1984, C.H. Bennet and G. Brassard proposed a new protocol aimed to solve the problem of symmetric cryptographic key exchange. This protocol was called BB84 after the name of its authors. While a traditional method would rely on public key cryptography ( ...

2003