Publications by Ioana Cristina Carlson

Security of Distance-Bounding: A Survey

Serge Vaudenay, Gildas Avoine, Martin Benjamin, Ioana Cristina Carlson, Srdan Capkun, Aslan Tchamkerten

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

2018

Method and device for proving his identity

Serge Vaudenay, Ioana Cristina Carlson

The invention is related to a method allowing a prover holding a secret key (x) to prove its identity to a verifier and to prove to this verifier that he is within a predetermined distance of this verifier, said method comprising an initialization phase du ...

2015

Primeless Factoring-Based Cryptography

Serge Vaudenay, Sonia Mihaela Bogos, Ioana Cristina Carlson

Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process ...

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

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

Primeless Modular Cryptography (Extended Abstract)

Serge Vaudenay, Sonia Mihaela Bogos, Ioana Cristina Carlson

Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...

2012

Several Weak Bit-Commitments Using Seal-Once Tamper-Evident Devices

Serge Vaudenay, Ioana Cristina Carlson

2012