Concept

Serveur de courriel anonyme

Publications associées (34)

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

Quantifying Location Privacy: The Case of Sporadic Location Exposure

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Reza Shokri, Georgios Theodorakopoulos

Mobile users expose their location to potentially untrusted entities by using location-based services. Based on the frequency of location exposure in these applications, we divide them into two main types: Continuous and Sporadic. These two location exposu ...

Springer-Verlag Berlin2011

Privacy Analysis of Forward and Backward Untraceable RFID Authentication Schemes

Khaled Ouafi

In this paper, we analyze the first known provably secure Radio Frequency Identification (RFID) authentication schemes that are designed to provide forward untraceability and backward untraceability: the L-K and S-M schemes. We show how to trace tags in th ...

Springer Verlag2011

Quantifying Location Privacy

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Reza Shokri, Georgios Theodorakopoulos

It is a well-known fact that the progress of personal communication devices leads to serious concerns about privacy in general, and location privacy in particular. As a response to these issues, a number of Location-Privacy Protection Mechanisms (LPPMs) ha ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Dissent: Accountable Group Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group. Messaging protocols such as Mix-nets and DC-nets leave online groups vulnerable to denial-of-service and Sybil attacks, while ...

2010

Public space in Beijing

Béatrice Ferrari

This is a short exploration of public space in Beijing (and elsewhere). But how do we define public space and does it exist as such in Beijing? In this short presentation, instead of simply focusing on physical spaces, I will try to capture some of the ele ...

2010

On Tamper-Resistance from a Theoretical Viewpoint: The Power of Seals

Serge Vaudenay

Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defeat some common privacy protection mechanisms. We propose the theoretical mode ...

Springer2009

Consensus and collision detectors in radio networks

Seth Gilbert

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...

2008

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Reza Shokri

Wireless ad hoc networks are so vulnerable to passive attacks and eavesdropping adversaries due to their shared medium which makes network traffic easy to capture and analyze. Therefore, security and privacy protections are of extreme importance for protoc ...

IEEE2007

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

Forensic automatic speaker recognition using Bayesian interpretation and statistical compensation for mismatched conditions

Nowadays, state-of-the-art automatic speaker recognition systems show very good performance in discriminating between voices of speakers under controlled recording conditions. However, the conditions in which recordings are made in investigative activities ...

EPFL2005