Related publications (32)

An Architecture-Independent Instruction Shuffler to Protect against Side-Channel Attacks

Paolo Ienne, Ali Galip Bayrak, Wayne Burleson, Nikola Velickovic

Embedded cryptographic systems, such as smart cards, require secure implementations that are robust to a variety of low-level attacks. Side-Channel Attacks (SCA) exploit the information such as power consumption, electromagnetic radiation and acoustic leak ...
2012

Mutual Authentication in RFID: Security and Privacy

Serge Vaudenay, Radu-Ioan Paise

In RFID protocols, tags identify and authenticate themselves to readers. At Asiacrypt 2007, Vaudenay studied security and privacy models for these protocols. We extend this model to protocols which offer reader authentication to tags. Whenever corruption i ...
ACM Press2008

SAS-Based Group Authentication and Key Agreement Protocols

Sylvain Pasini

New trends in consumer electronics have created a strong demand for fast, reliable and user-friendly key agreement protocols. However, many key agreement protocols are secure only against passive attacks. Therefore, message authentication is often unavoida ...
Springer2008

Bi-Modal Face and Speech Authentication: a BioLogin Demonstration System

Sébastien Marcel, Yann Rodriguez

This paper presents a bi-modal (face and speech) authentication demonstration system that simulates the login of a user using its face and its voice. This demonstration is called BioLogin. It runs both on Linux and Windows and the Windows version is freely ...
IDIAP2006

Bi-Modal Face and Speech Authentication: a BioLogin Demonstration System

Sébastien Marcel, Yann Rodriguez

This paper presents a bi-modal (face and speech) authentication demonstration system that simulates the login of a user using its face and its voice. This demonstration is called BioLogin. It runs both on Linux and Windows and the Windows version is freely ...
2006

Secure communications over insecure channels based on short authenticated strings

Serge Vaudenay

We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g. 15 bits. We call this SAS-based authentication as for authentication based on short a ...
2005

Key agreement over a radio link

Jean-Pierre Hubaux, Mario Cagalj

We present a simple, and yet powerful, technique for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol. This protocol is known to be vulnerable to the ``man-in-the-middle" attac ...
2004

SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchroni ...
2003

Adaptation robuste de modeles HMM pour la verification du locuteur dependante du texte

When deploying a secure system based on speaker verification, the limited amount of training data is usually critical. Indeed, the enrollment procedure must be fast and user-friendly. An incremental training of HMM speaker models, based on a MAP (Maximum A ...
2000

Robust and secure password and key change method

Philippe Janson

This paper discusses issues and idiosyncrasies associated with changing passwords and keys in distributed computer systems. Current approaches are often complicated and fail to provide the desired level of security and fault tolerance. A novel and very sim ...
1996

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.