Publication

SAS-Based Group Authentication and Key Agreement Protocols

Publications associées (99)

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

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

Fast Key Recovery Attack on ARMADILLO1 and Variants

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The ARMADILLO cryptographic primitive is a multi-purpose cryptographic primitive for RFID devices proposed at CHES’10. The main purpose of the primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMA ...

Springer2011

Model Checking Security Protocols: A Multiagent System Approach

Security protocols specify the communication required to achieve security objectives, e.g., data-privacy. Such protocols are used in electronic media: e-commerce, e-banking, e-voting, etc. Formal verification is used to discover protocol-design flaws. In t ...

Imperial College London2011

OREN: Optimal Revocations in Ephemeral Networks

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Public-key certificates allow a multitude of entities to securely exchange and verify the authenticity of data. However, the ability to effectively revoke compromised or untrustworthy certificates is of great importance when coping with misbehavior. In thi ...

2011

A Note on a Privacy-Preserving Distance-Bounding Protocol

Aikaterini Mitrokotsa, Jean-Philippe Aumasson

Distance bounding protocols enable a device to establish an upper bound on the physical distance to a communication partner so as to prevent location spoofing, as exploited by relay attacks. Recently, Rasmussen and Cˇapkun (ACM-CCS’08) observed that these ...

Springer2011

A cryptographically t-private auction system

Tiark Rompf

We present a cryptographically t-private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a f ...

2011

Pollution Attack Defense for Coding Based Sensor Storage

László Czap, Levente Buttyan

We present a novel information theoretic approach to make network coding based storage secure against pollution attacks in sensor networks. The approach is based on a new decoding algorithm which makes it possible to ﬁnd adversarial blocks using one more e ...

2010

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010

Signatures for Multisource Network Coding

László Czap

We consider the problem of securing inter-ﬂow network coding with multiple sources. We present a practical homomorphic signature scheme that makes possible to verify network coded packets composed of data originating from diﬀerent sources. The multi-source ...

ArXiv2010

Optimal Revocations in Ephemeral Networks: A Game-Theoretic Framework

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Revocation of public-key certificates is an important security primitive. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networks - a class of extremely volatile wireless networks with short-duration and shor ...

IEEE2010

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010