Publications by Aikaterini Mitrokotsa

Expected Loss Analysis for Authentication in Constrained Channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, where at least some part of the authentication ...

IOS Press2015

Practical and Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recentl ...

IOS Press2015

Location leakage in distance bounding: Why location privacy does not work

Serge Vaudenay, Aikaterini Mitrokotsa

In many cases, we can only have access to a service by proving we are sufficiently close to a particular location (e.g. in automobile or building access control). In these cases, proximity can be guaranteed through signal attenuation. However, by using add ...

Elsevier2014

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

Intrusion Detection in MANET Using Classification Algorithms: The Effects of Cost and Model Selection

Christos Dimitrakakis, Aikaterini Mitrokotsa

Intrusion detection is frequently used as a second line of defense in Mobile Ad-hoc Networks (MANETs). In this paper we examine how to properly use classification methods in intrusion detection for MANETs. In order to do so we evaluate five supervised clas ...

Elsevier2013

Practical & Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. At FSE 2013, we presented SKI as the first family of provably sec ...

2013

Secure & Lightweight Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa, Ioana Cristina Carlson

Distance-bounding is a practical solution to be used in security-sensitive contexts, mainly to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect again ...

2013

Expected loss bounds for authentication in constrained channels

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

We derive bounds on the expected loss for authenti-cation protocols in channels which are constrained due to noisyconditions and communication costs. This is motivated by anumber of authentication protocols, where at least some partof the authentication is ...

Ieee2012

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

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, Ioana Cristina Carlson, Iosif-Daniel Spulber

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, even ...

Springer2012

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

Serge Vaudenay, Aikaterini Mitrokotsa, Ioana Cristina Carlson

In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/incomplete. We identify that this inadequacy stems from the fact that the pseudorandom function (PRF) assumption alone, invoked in many ...

Springer2012