Publications associées à Security of Distance-Bounding: A Survey

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Circular Security Reconsidered

Serge Vaudenay, Fatma Betül Durak

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Depen ...

Springer International Publishing2016

Privacy failure in the public-key distance-bounding protocols

Serge Vaudenay

Public-key distance bounding protocols are well suited to defeat relay attacks in proximity access control systems when the author assume no prior shared key. At AsiaCCS 2014, Gambs, Onete, and Robert designed such a protocol with privacy protection for th ...

Inst Engineering Technology-Iet2016

Cyber-attack on Packet-Based Time Synchronization Protocols: the Undetectable Delay Box

Jean-Yves Le Boudec, Aswin Suresh, Sergio Barreto Andrade

We present a cyber-attack on packet-based time synchronization protocols (PBTSP) with high-accuracy requirements. The cyber-attack is undetectable from the PBTSP's perspective and exploits a vulnerability that is in the nature of all PBTSPs. It can be succ ...

Ieee2016

Distance Bounding based on PUF

Serge Vaudenay, Mathilde Igier

Distance Bounding (DB) is designed to mitigate relay attacks. This paper provides a complete study of the DB protocol of Kleber et al. based on Physical Unclonable Functions (PUFs). We contradict the claim that it resists to Terrorist Fraud (TF). We propos ...

Springer Int Publishing Ag2016

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

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

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Christopher Tucci, Gianluigi Viscusi

In conventional wisdom on crowdsourcing, the number of people define the crowd and maximizing this number is often assumed to be the goal of any crowdsourcing exercise. However, we propose that there are structural characteristics of the crowd that might b ...

SSRN2015

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

Security of Distance-Bounding: A Survey

Graph Chatbot

Chattez avec Graph Search

Efficient Public-Key Distance Bounding Protocol

Circular Security Reconsidered

Privacy failure in the public-key distance-bounding protocols

Cyber-attack on Packet-Based Time Synchronization Protocols: the Undetectable Delay Box

Distance Bounding based on PUF

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Optimal Proximity Proofs Revisited

Challenges in Distance Bounding

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Practical and Provably Secure Distance-Bounding

Efficient Public-Key Distance Bounding Protocol

Circular Security Reconsidered

Cyber-attack on Packet-Based Time Synchronization Protocols: the Undetectable Delay Box

Distance Bounding based on PUF

Privacy failure in the public-key distance-bounding protocols

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Optimal Proximity Proofs Revisited

Challenges in Distance Bounding

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Practical and Provably Secure Distance-Bounding