Publication

A Note on a Privacy-Preserving Distance-Bounding Protocol

Publications associées (36)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

On Multi-Dimensional Privacy in Context-Aware Mobile Networks

Igor Bilogrevic

By the end of 2013, the number of internet-connected mobile devices is expected to exceed that of humans. Omnipresent and context-aware, mobile devices enable people to communicate and exchange data anytime and almost anywhere. The myriad of ”digital footp ...

EPFL2014

Low cost security for sensor networks

Christina Fragouli, Lorenzo Keller, Iris Safaka, Emre Atsan

We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by a ...

Institute of Electrical and Electronics Engineers Inc.2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

Input-Aware Equivocable Commitments and UC-secure Commitments With Atomic Exchanges

Serge Vaudenay

We define a new primitive, input-aware equivocable commitment, baring similar hardness assumptions as plaintext-aware encryption and featuring equivocability. We construct an actual input-aware equivocable commitment protocol, based on a flavor of Diffie-H ...

Springer2013

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

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 Modeling Terrorist Frauds

Serge Vaudenay

Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks. Their security models at still unstable, especially when considering terrorist fraud. This considers the case where a malicious p ...

Springer2013

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

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, 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 ...

Springer,2012

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

Serge Vaudenay, Aikaterini Mitrokotsa

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

Security and Privacy in RFID Systems

Khaled Ouafi

This PhD thesis is concerned with authentication protocols using portable lightweight devices such as RFID tags. these devices have lately gained a significant attention for the diversity of the applications that could benefit form their features, ranging ...

EPFL2012