Start-up

Inpher

Publications associées (162)

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

Architecture for Secure and Private Vehicular Communications

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Maxime Raya, Levente Buttyan

The deployment of vehicular communication (VC) systems is strongly dependent on their security and privacy features. In this paper, we propose a security architecture for VC. The primary objectives of the architecture include the management of identities a ...

2007

Mix-Zones for Location Privacy in Vehicular Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Mark Felegyhazi, Julien Freudiger, Maxime Raya

Vehicular Networks (VNs) seek to provide, among other applications, safer driving conditions. To do so, vehicles need to periodically broadcast safety messages providing precise position information to nearby vehicles. However, this frequent messaging (e.g ...

2007

On Privacy Models for RFID

Serge Vaudenay

We provide a formal model for identification schemes. Under this model, we give strong definitions for security and privacy. Our model captures the notion of a powerful adversary who can monitor all communications, trace tags within a limited period of tim ...

Springer-Verlag2007

RFID Privacy based on Public-Key Cryptography (Abstract)

Serge Vaudenay

RFID systems makes it possible for a server to identify known tags in wireless settings. As they become more and more pervasive, people privacy is more and more threatened. In this talk, we list a few models for privacy in RFID and compare them. We review ...

2006

Noisy Tags: A Pretty Good Key Exchange Protocol for RFID Tags

Gildas Avoine

We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag suggested by Juels, Rivest, and Szydlo, our scheme makes use of special tags that ...

2006

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

Smart video surveillance system preserving privacy

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we present a smart video surveillance system based on standard technologies and wired or wireless IP networking. The key novelty of the system is that it protects the privacy of people under surveillance. More specifically, a video analysis ...

2005

Weighted Threshold Secret Sharing Based on the Chinese Remainder Theorem

A secret sharing scheme derives from a given secret certain shares (or shadows) which are distributed to users. The secret can be recovered only by certain predetermined groups. In the first secret sharing schemes only the number of the participants in the ...

2005

Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks

Jean-Pierre Hubaux, Srdan Capkun

We present a scheme for secure and privacy-preserving communication in hybrid ad hoc networks. Our scheme enables users to secure communication and to protect their anonymity and location privacy. Our approach is based on frequently changing node pseudonym ...

2004

On solving distributed CS(O)Ps with privacy

Cryptographic protocols can enforce privacy in distributed computation of functions [Goldwasser'96] and are a competitor of the distributed constructive search techniques. [Goldreich'87,Chaum'87,Chaum'88,Ben-or'88] show how cryptographic protocols can be c ...

2002