In this paper, we propose and implement a novel IDbased secure ranging protocol. Our protocol is inspired by existing authenticated ranging and distance–bounding protocols, and is tailored to work on existing Ultra Wide Band (UWB) ranging platforms. Building on the implementation of secure ranging, we further implement a secure localization protocol that enables the computation of a correct dev...

Distance bounding (DB) emerged as a countermeasure to the so-called relay attack, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that,...

Although much research was conducted on devising intuitive interaction paradigms with pervasive computing devices, it has not been realized that authentication, an important need in this context, has a strong impact on the ease of use. More specifically, distance-bounding protocols are necessary in some of the most interesting scenarios in pervasive computing. This article describes a drag-and-...

The Mafia fraud consists in an adversary transparently relaying the physical layer signal during an authentication process between a verifier and a remote legitimate prover. This attack is a major concern for certain RFID systems, especially for payment related applications. Previously proposed protocols that thwart the Mafia fraud treat relaying and nonrelaying types of attacks equally: whethe...

We use the class of surfaces with quadratic polynomial support functions in order to define bounding geometric primitives for shortest distance computation. The common normals of two such surfaces can be computed by solving a single polynomial equation of degree six. Based on this observation, we formulate an algorithm for computing the shortest distance between enclosures of two moving or stat...

The design and understanding of plasma and its bounding sheath requires an effective modeling technique that is both adaptable to arbitrary geometry and time accurate. We present a finite-element-based model for two-fluid plasma. The continuity and momentum equations for electrons and ions are solved simultaneously with the Poisson equation, using an efficient subgrid-embedded algorithm. The mo...

The items in a spatial database have location, extent, and shape with respect to a spatial coordinate system. Simple approximations to these attributes, say by bounding rectangles, are storage efficient and easy to manipulate. But effective spatial retrieval (on either location, extent, or shape) require a more precise representation of these attributes. In this report, we describe a highly com...

As mobile devices pervade physical space, the familiar authentication patterns are becoming insufficient: besides entity authentication, many applications require, e.g. location authentication. While many interesting and subtle protocols have been proposed and implemented to provide such strengthened authentication, there are very few proofs that such protocols satisfy the required properties. ...

We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some ooset. The set of core primitive shapes includes a point, line, and rectangle. Thi...