Personne

Philippe Oechslin

Publications associées (11)

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

Cyber-secure Communication Architecture for Active Power Distribution Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Philippe Oechslin, Teklemariam Tsegay Tesfay

Active power distribution networks require sophisticated monitoring and control strategies for efficient energy management and automatic adaptive reconfiguration of the power infrastructure. Such requirements are realized by deploying a large number of var ...

2014

Reducing Time Complexity in RFID Systems

Gildas Avoine, Philippe Oechslin, Etienne Dysli

Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the productivity or to strengthen the security. Specific identification protocols base ...

2006

Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints, Extended Version

Gildas Avoine, Philippe Oechslin, Pascal Junod

Since the original publication of Martin Hellman's cryptanalytic time-memory trade-off, a few improvements on the method have been suggested. In all these variants, the cryptanalysis time decreases with the square of the available memory. However, a large ...

2005

Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints

Gildas Avoine, Philippe Oechslin, Pascal Junod

2005

A Scalable and Provably Secure Hash-Based RFID Protocol

Gildas Avoine, Philippe Oechslin

The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions have been suggested but almost as many ways have been found to break them. An approach by Ohkubo, Suzuki and Kinoshita using an in ...

2005

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

Les compromis temps-mémoire et leur utilisation pour casser les mots de passe Windows

Philippe Oechslin

Les compromis temps-m emoire sont des m ethodes qui per- mettent de r eduire le temps d'ex ecution d'un algorithme en augmen- tant la quantit e de m emoire utilis ee. Dans cet article nous pr esentons di erentes variantes de compromis temps-m emoire qui permettent d'acc el erer le cassage de mots de passe. Nous expliquons comment con gurer un tel compromis pour obtenir le cassage le plus rapide, comment estimer les performances que l'on peut esp erer atteindre et nous montrons comment impl ementer cette m ethode de mani ere e cace pour casser les mots de passe des syst emes Windows.

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

Tracing attacks and restoring integrity with LASCAR

Philippe Oechslin, Alexandre Aellig

We present a novel method to trace the propagation of intrusions or malicious code in networked systems. Our solution is aimed at large numbers of loosely managed workstations typical of a research environment as found in CERN. The system tags events which ...

2003

Making a Faster Cryptanalytic Time-Memory Trade-Off

Philippe Oechslin

In 1980 Martin Hellman described a cryptanalytic time-memory trade-off which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points whi ...

2003