Publication

On the Privacy of Anonymized Networks

Related publications (38)

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.

This article introduces a new class of models for multiple networks. The core idea is to parameterize a distribution on labeled graphs in terms of a Frechet mean graph (which depends on a user-specified choice of metric or graph distance) and a parameter t ...

AMER STATISTICAL ASSOC2020

MorphIT: Morphing Packet Reports for Internet Transparency

Bryan Alexander Ford, Georgia Fragkouli

Can we improve Internet transparency without worsening user anonymity? For a long time, researchers have been proposing transparency systems, where traffic reports produced at strategic network points help assess network behavior and verify service-level a ...

Sciendo2019

, , ,

Exemplary embodiments of the present disclosure provide cryptographically-strong tracking protection with unnoticeable "single-hop" network latencies by leveraging a client-relay- server architecture, in which the clients, relays (trusted or untrusted), an ...

2018

Atom: Horizontally Scaling Strong Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system’s capacity scales near ...

Association for Computing Machinery2017

Networks are data structures that are fundamental for capturing and analyzing complex interactions between objects. While they have been used for decades to solve problems in virtually all scientific fields, their usage for data analysis in real-world prac ...

EPFL2017

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

Riffle: An Efficient Communication System With Strong Anonymity

Bryan Alexander Ford, David Lazar

Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on ...

2016

, ,

Network alignment refers to the problem of matching the vertex sets of two unlabeled graphs, which can be viewed as a generalization of the classic graph isomorphism problem. Network alignment has applications in several fields, including social network an ...

2015

Towards Unconditional Tor-Like Anonymity

Christina Fragouli, László Czap, Iris Safaka

We design and evaluate a traffic anonymization protocol for wireless networks, aiming to protect against computationally powerful adversaries. Our protocol builds on recent key-generation techniques, that leverage intrinsic properties of the wireless toget ...

2015

, , , ,

Location check-ins contain both geographical and semantic information about the visited venues, in the form of tags (e.g., “restaurant”). Such data might reveal some personal information about users beyond what they actually want to disclose, hence their p ...

2015