Publication

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Publications associées (37)

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

Model Checking Security Protocols: A Multiagent System Approach

Security protocols specify the communication required to achieve security objectives, e.g., data-privacy. Such protocols are used in electronic media: e-commerce, e-banking, e-voting, etc. Formal verification is used to discover protocol-design flaws. In t ...

Imperial College London2011

A Note on a Privacy-Preserving Distance-Bounding Protocol

Aikaterini Mitrokotsa, Jean-Philippe Aumasson

Distance bounding protocols enable a device to establish an upper bound on the physical distance to a communication partner so as to prevent location spoofing, as exploited by relay attacks. Recently, Rasmussen and Cˇapkun (ACM-CCS’08) observed that these ...

Springer2011

Effectiveness of Distance-Decreasing Attacks Against Impulse Radio Ranging

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Manuel Flury

We expose the vulnerability of an emerging wireless ranging technology, impulse radio ultra-wide band (IR-UWB), to distance-decreasing attacks on the physical communication layer (PHY). These attacks violate the security of secure ranging protocols that al ...

2010

Distance Bounding with IEEE 802.15.4a: Attacks and Countermeasures

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Manuel Flury

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

2010

Model Checking Detectability of Attacks in Multiagent Systems

Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicability. We introduce a taxonomy of detectability specifications expressed in tem ...

International Foundation for Autonomous Agents and Multiagent Systems2010

Smashing SQUASH-0

Serge Vaudenay, Khaled Ouafi

At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol, which we call SQUASH-0, was using a linear mixing function which was subse ...

Springer2009

On Tamper-Resistance from a Theoretical Viewpoint: The Power of Seals

Serge Vaudenay

Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defeat some common privacy protection mechanisms. We propose the theoretical mode ...

Springer2009

SAS-Based Group Authentication and Key Agreement Protocols

Sylvain Pasini

New trends in consumer electronics have created a strong demand for fast, reliable and user-friendly key agreement protocols. However, many key agreement protocols are secure only against passive attacks. Therefore, message authentication is often unavoida ...

Springer2008

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating ...

2008

Secure incentives to cooperate for wireless networks

The operating principle of certain wireless networks makes essential the cooperation between the mobile nodes. However, if each node is an autonomous selfish entity, cooperation is not guaranteed and therefore we need to use incentive techniques. In this t ...

EPFL2007