Publications related to Practical and Provably Secure Distance-Bounding

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Tight Lower Bound for Entropy Flattening

Mika Tapani Göös, Jiapeng Zhang

We study entropy flattening: Given a circuit C_X implicitly describing an n-bit source X (namely, X is the output of C_X on a uniform random input), construct another circuit C_Y describing a source Y such that (1) source Y is nearly flat (uniform on its s ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2018

Creating Secrets Out Of Packet Erasures

Christina Fragouli, László Czap, Iris Safaka

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Genomic diversity and disease prevalence in Ugandan cattle

Stéphane Joost, Sylvie Stucki, Elia Vajana, Pierre Taberlet

Ugandan cattle are represented by three main types: the long-horned Ankole, the short-horned zebu, and the Ankole-zebu crosses called “Nganda”. In the course of the EU-funded project Nextgen, Ugandan cattle have been extensively sampled over the whole coun ...

2015

Optimal Proximity Proofs Revisited

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...

Springer Verlag2015

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

Towards Secure Distance Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Relay attacks (and, more generally, man-in-the-middle attacks) are a serious threat against many access control and payment schemes. In this work, we present distance-bounding protocols, how these can deter relay attacks, and the security models formalizin ...

2013

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

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

2013

Practical and Provably Secure Distance-Bounding

Graph Chatbot

Chat with Graph Search

A Tight Lower Bound for Entropy Flattening

Creating Secrets Out Of Packet Erasures

Optimal Proximity Proofs

Genomic diversity and disease prevalence in Ugandan cattle

Optimal Proximity Proofs Revisited

Practical & Provably Secure Distance-Bounding

Towards Secure Distance Bounding

On Selecting the Nonce Length in Distance-Bounding Protocols

On Selecting the Nonce Length in Distance-Bounding Protocols

The CORALIE survey for southern extrasolar planets XVII. New and updated long period and massive planets

A Tight Lower Bound for Entropy Flattening

Creating Secrets Out Of Packet Erasures

The CORALIE survey for southern extrasolar planets XVII. New and updated long period and massive planets

Optimal Proximity Proofs Revisited

Optimal Proximity Proofs

Practical & Provably Secure Distance-Bounding

On Selecting the Nonce Length in Distance-Bounding Protocols

Genomic diversity and disease prevalence in Ugandan cattle

On Selecting the Nonce Length in Distance-Bounding Protocols

Towards Secure Distance Bounding