Publication

Security and Privacy in RFID Systems

Publications associées (144)

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

TCHo: A Code-Based Cryptosystem

Serge Vaudenay, Alexandre Raphaël Duc

TCHo is a public-key cryptosystem based on the hardness of finding a multiple polynomial with low weight and on the hardness of distinguishing between the output of an LFSR with noise and some random source. An early version was proposed in 2006 by Finiasz ...

Springer Berlin Heidelberg2013

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Serge Vaudenay, Alexandre Raphaël Duc

We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguisha ...

Springer2013

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

Erman Ayday

In this paper, we propose secure and intuitive device authentication techniques for the Smart Grid enabled Home Area Networks (HANs). We assume a distributed architecture for the HAN in which the smart appliances can communicate both with the smart meter a ...

2013

Bi-Modal Biometric Authentication on Mobile Phones in Challenging Conditions

Sébastien Marcel, Laurent El Shafey

This paper examines the issue of face, speaker and bi-modal authentication in mobile environments when there is significant condition mismatch. We introduce this mismatch by enrolling client models on high quality biometric samples obtained on a laptop com ...

Idiap2013

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Pouyan Sepehrdad

Symmetric cryptographic primitives such as block and stream ciphers are the building blocks in many cryptographic protocols. Having such blocks which provide provable security against various types of attacks is often hard. On the other hand, if possible, ...

EPFL2012

Strong Privacy for RFID Systems from Plaintext-Aware Encryption

Serge Vaudenay, Khaled Ouafi

he Vaudenay model for RFID privacy from Asiacrypt 2007 suffers from the impossibility to address strong privacy. It has however been shown by Ng et al. at ESORICS 2008 that the impossibility result leads to no practical threat, so that the definition from ...

Springer2012

Faster Software Cryptography

Dag Arne Osvik

This thesis presents work on the efficiency and security of cryptographic software. First it describes several efforts to construct very efficient implementations of cryptographic primitives. These include the Advanced Encryption Standard (AES) as well as ...

EPFL2012

Cryptanalysis of the Double-Moduli Cryptosystem

Serge Vaudenay, Sonia Mihaela Bogos

In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]. We show how, based on the relation between the public and private key, we can construct an attack which allows any passive adversary to decrypt the encr ...

2012

Distributed Authentication in Anonymous Mobile Communities

Hamza Harkous

With the recent boom in smartphones technology, online social networks are going mobile. This trend urged phone manufacturers and social networking companies to seek novel business strategies to monetize from these new "gateways" and to give the users ...

2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Bolívar Cevallos Manzano

We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shar ...

Springer-Verlag2012