Person

Gildas Avoine

This person is no longer with EPFL

Related publications (21)

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.

RFID Traceability: A Multilayer Problem

Gildas Avoine, Philippe Oechslin

RFID tags have very promising applications in many domains (retail, rental, surveillance, medicine to name a few). Unfortunately the use of these tags can have serious implications on the privacy of people carrying tagged items. Serious opposition from con ...

2005

Reducing Fair Exchange to Atomic Commit

Rachid Guerraoui, Serge Vaudenay, Marko Vukolic, Gildas Avoine, Felix Gaertner

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but c ...

2005

Fraud within Asymmetric Multi-Hop Cellular Networks

Gildas Avoine

At Financial Cryptography 2003, Jakobsson, Hubaux, and Buttyan suggested a lightweight micro-payment scheme aimed at encouraging routing collaboration in asymmetric multi-hop cellular networks. We will show in this paper that this scheme suffers from some ...

2005

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...

2004

Privacy issues in RFID banknote protection schemes

Gildas Avoine

Radio Frequency Identification systems are in the limelight for a few years and become pervasive in our daily lives. These smart devices are nowadays embedded in the consumer items and may come soon into our banknotes. At Financial Cryptography 2003, Juels ...

2004

Advances in Alternative Non-Adjacent Form Representations

Gildas Avoine, Jean Monnerat

From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits are in {0,1}. In cryptography, the non-adjacent digit set (NADS) {-1,0,1} is used for ...

2004

Reducing Fair Exchange to Atomic Commit

Rachid Guerraoui, Serge Vaudenay, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties.We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but ca ...

2004

Sécurité informatique, exercices corrigés

Gildas Avoine, Philippe Oechslin, Pascal Junod

Les attaques informatiques sont aujourd'hui l'un des fléaux de notre civilisation. Chaque semaine amène son lot d'alertes concernant des failles dans la sécurité des systèmes d'information, exploitées par pirates et autres créateurs de virus. Ces attaques ...

Vuibert2004

Optimistic Fair Exchange based on Publicly Verifiable Secret Sharing

Serge Vaudenay, Gildas Avoine

In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants. This new concept, which is b ...

2004

Cryptography with Guardian Angels: Bringing civilization to pirates - Abstract

Serge Vaudenay, Gildas Avoine

In contrast with traditional cryptographic protocols in which parties can have access to common third parties, and where at least one of them is assumed to be honest, we propose here a new model which is relevant for networks of communication devices with ...

2003