Concept

Multi-factor authentication

Publications associées (153)

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

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux

Passports are documents that help immigration officers to identify people. In order to strongly authenticate their data and to automatically identify people, they are now equipped with RFID chips. These contain private information, biometrics, and a digita ...

2007

Multi-system biometric authentication

Norman Hoon Thian Poh

Verifying a person's identity claim by combining multiple biometric systems (fusion) is a promising solution to identity theft and automatic access control. This thesis contributes to the state-of-the-art of multimodal biometric fusion by improving the und ...

EPFL2007

Person Authentication using Brainwaves (EEG) and Maximum A Posteriori Model Adaptation

José del Rocio Millán Ruiz, Sébastien Marcel

In this paper, we investigate the use of brain activity for person authentication. It has been shown in previous studies that the brain-wave pattern of every individual is unique and that the electroencephalogram (EEG) can be used for biometric identificat ...

2007

Face authentication based on local features and generative models

The principal objective of this thesis is to investigate approaches toward a robust automatic face authentication (AFA) system in weakly constrained environments. In this context, we develop new algorithms based on local features and generative models. In ...

EPFL2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

2006

Local Binary Patterns as an Image Preprocessing for Face Authentication

Sébastien Marcel, Guillaume Heusch, Yann Rodriguez

One of the major problem in face authentication systems is to deal with variations in illumination. In a \mbox{realistic} scenario, it is very likely that the lighting conditions of the probe image does not correspond to those of the gallery image, hence t ...

2006

On the Recent Use of Local Binary Patterns for Face Authentication

Sébastien Marcel, Guillaume Heusch, Yann Rodriguez

This paper presents a survey on the recent use of Local Binary Patterns (LBPs) for face recognition. LBP is becoming a popular technique for face representation. It is a non-parametric kernel which summarizes the local spacial structure of an image and it ...

IDIAP2006

Face Authentication Using Adapted Local Binary Pattern Histograms

Sébastien Marcel, Yann Rodriguez

In this paper, we propose a novel generative approach for face authentication, based on a Local Binary Pattern (LBP) description of the face. A generic face model is considered as a collection of LBP-histograms. Then, a client-specific model is obtained by ...

IDIAP2006

Face Authentication Using Adapted Local Binary Pattern Histograms

Sébastien Marcel, Yann Rodriguez

2006

SAS-based Authenticated Key Agreement

Serge Vaudenay, Sylvain Pasini

Key agreement protocols are frequently based on the Diffie-Hellman protocol but require authenticating the protocol messages in two ways. This can be made by a cross-authentication protocol. Such protocols, based on the assumption that a channel which can ...

Springer2006