Concept

Proxy anonymiseur

Publications associées (32)

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

Efficient Key Exchange for Wireless Multi-hop Networks

Christina Fragouli, László Czap, Iris Safaka

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protoc ...

2015

A Bayesian Approach to Detect Pedestrian Destination-Sequences from WiFi Signatures

Michel Bierlaire, Bilal Farooq, Antonin Danalet

In this paper, we propose a methodology to use the communication network infrastructure, in particular WiFi traces, to detect the sequence of activity episodes visited by pedestrians. Due to the poor quality of WiFi localization, a probabilistic method is ...

2014

The Generalized Loneliness Detector and Weak System Models for k-Set Agreement

Martin Biely

This paper presents two weak partially synchronous system models Manti(n-k) and Msink(n-k), which are just strong enough for solving k-set agreement: We introduce the generalized (n-k)-loneliness failure detector L(k), which we first prove to be sufficient ...

Ieee Computer Soc2014

SpeakUp – A Mobile App Facilitating Audience Interaction

Adrian Christian Holzer, Andrii Vozniuk, Sten Govaerts, Benoît Garbinato

A dynamic student-teacher interaction during class is an important part of the learning experience. However, in regular class settings and especially in large classrooms, it is a challenging task to encourage students to participate as they tend to be inti ...

2013

Privacy and Dynamics of Social Networks

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...

EPFL2013

Dissent in Numbers: Making Strong Anonymity Scale

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Current anonymous communication systems make a trade-off between weak anonymity among many nodes, via onion routing, and strong anonymity among few nodes, via DC-nets. We develop novel techniques in Dissent, a practical group anonymity system, to increase ...

2012

Privacy and Dynamics of Social Networks (PhD Thesis: pre-print)

Pedram Pedarsani

2012

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...

2011

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

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