Publications de Marcin Poturalski

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.

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

To provide high ranging precision in multipath environments, a ranging protocol should find the first arriving path, rather than the strongest path. We demonstrate a new attack vector that disrupts such precise Time-of-Arrival (ToA) estimation, and allows ...

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

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 wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant c ...

Wireless networking relies on a fundamental building block, neighbor discovery (ND). The nature of wireless communications, however, makes attacks against ND easy: An adversary can simply replay or relay (wormhole) packets across the network and mislead di ...

Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within direct radio communication, is a building block of network protocols and app ...

Wireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, however, this comes at a price: A single adversary can severely influence the outcome by contributing an arbitrary partial aggregate value. Secure in-network aggregation can det ...

We demonstrate that an interferer with malicious intentions can significantly degrade the performance of impulse radio (IR) ranging. The cicada attack we have developed can decrease the distance (degradation of service) measured by ranging algorithms desig ...

Pervasive computing systems will likely be deployed in the near future, with the proliferation of wireless devices and the emergence of ad hoc networking as key enablers. Coping with mobility and the volatility of wireless communications in such systems is ...

Marcin Poturalski

Chattez avec Graph Search

Effectiveness of Distance-Decreasing Attacks Against Impulse Radio Ranging

On Secure and Precise IR-UWB Ranging

Castor: Scalable Secure Routing for Ad Hoc Networks

Distance Bounding with IEEE 802.15.4a: Attacks and Countermeasures

Towards Provable Secure Neighbor Discovery in Wireless Networks

A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks

Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility

Efficient and Robust Secure Aggregation for Sensor Networks

The Cicada Attack: Degradation and Denial of Service in IR Ranging

Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networking