Gildas Avoine

Prof. Gildas Avoine


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2009
Verified
Book Chapter
Open access
PDF file
CKChong Hee Kim
Chong Hee Kim
GAGildas Avoine
Gildas Avoine
FKFrançois Koeune
François Koeune
FSFrançois-Xavier Standaert
François-Xavier Standaert
OPOlivier Pereira
Olivier Pereira
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicinity by surreptitiously forwarding the signal between the verifier and an out-of-field prover. Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages. Several such protocols have been designed during the last years but none of them combine all the features one may expect in a RFID system. We introduce in this paper the first solution that compounds in a single protocol all these desirable features. We prove, with respect to the previous protocols, that our proposal is the best one in terms of security, privacy, tag computational overhead, and fault tolerance. We also point out a weakness in Tu and Piramuthu’s protocol, which was considered up to now as one of the most efficient distance bounding protocol.

25 September 2018 in ACM Computing Surveys
Verified
Journal Article
Open access
PDF file
GAGildas Avoine
Gildas Avoine
Muhammed Ali BingolMuhammed Ali Bingol
Muhammed Ali Bingol
IBIoana Boureanu
Ioana Boureanu
SČSrdjan Čapkun
Srdjan Čapkun
GHGerhard Hancke
Gerhard Hancke
SVSerge Vaudenay
Serge Vaudenay
Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g., electronic payment or access control systems, which are vulnerable to distance-based frauds. This survey analyzes and compares in a unified manner many existing distance-bounding protocols with respect to several key security and complexity features.

2 October 2021
Verified
Book Chapter
Closed access
PDF file
GAGildas Avoine
Gildas Avoine
XCXavier Carpent
Xavier Carpent
DLDiane Leblanc-Albarel
Diane Leblanc-Albarel

10 July 2023
Verified
Conference Paper
Open access
GAGildas Avoine
Gildas Avoine
XCXavier Carpent
Xavier Carpent
DLDiane Leblanc-Albarel
Diane Leblanc-Albarel
A cryptanalytic time-memory trade-off is a technique introduced by M. Hellman in 1980 to perform brute-force attacks. It consists of a time-consuming precomputation phase performed and stored once and for all, which is then used to reduce the computation time of brute-force attacks. A variant, known as rainbow tables, introduced by Oechslin in 2003 is used by most of today’s off-the-shelf password-guessing tools. Precomputation of such tables is highly inefficient however, because much of the values computed during this task are eventually discarded. This paper revisits rainbow tables precomputation, challenging what has so far been regarded as an immutable foundation. The key idea consists in recycling values discarded during the precomputation phase, and adapting the brute force phase to make use of these recycled values. For a given memory and probability of success, the stepped rainbow tables thus created significantly reduce the workload induced by both the precomputation phase and the attack phase. The speedup obtained by using such tables is provided, and backed up by practical experiments.

1 January 2015
Verified
Book Chapter
Open access
PDF file
GAGildas Avoine
Gildas Avoine
XCXavier Carpent
Xavier Carpent
CLCédric Lauradoux
Cédric Lauradoux
Cryptanalytic time-memory trade-offs (TMTO) are famous tools available in any security expert toolbox. They have been used to break ciphers such as A5/1, but their efficiency to crack passwords made them even more popular in the security community. While symmetric keys are generated randomly according to a uniform distribution, passwords chosen by users are in practice far from being random, as confirmed by recent leakage of databases. Unfortunately, the technique used to build TMTOs is not appropriate to deal with non-uniform distributions. In this paper, we introduce an efficient construction that consists in partitioning the search set into subsets of close densities, and a strategy to explore the TMTOs associated to the subsets based on an interleaved traversal. This approach results in a significant improvement compared to currently used TMTOs. We experimented our approach on a classical problem, namely cracking 7-character NTLM Hash passwords using an alphabet with 34 special characters. This resulted in speedups ranging from 16 to 76 (depending on the input distribution) over rainbow tables, which are considered as the most efficient variant of time-memory trade-offs.

15 January 2021
Verified
Book Chapter
Open access
PDF file
GAGildas Avoine
Gildas Avoine
IBIoana Boureanu
Ioana Boureanu
DGDavid Gérault
David Gérault
GHGerhard P. Hancke
Gerhard P. Hancke
PLPascal Lafourcade
Pascal Lafourcade
COCristina Onete
Cristina Onete
We present the concept of relay attacks, and discuss distance-bounding schemes as the main countermeasure. We give details on relaying mechanisms, we review canonical distance-bounding protocols, as well as their threat-model (i.e., covering attacks beyond relaying) stemming from the authentication dimension in distance bounding. Advanced aspects of distance-bounding security are also covered. We conclude by presenting what we consider to be the most important challenges in distance bounding.