Publication

Differential Privacy with Bounded Priors: Reconciling Utility and Privacy in Genome-Wide Association Studies

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.

Protecting Privacy in Multi-agent Optimization

Eric Zbinden

Many real-life optimization problems involve multiple entities, or agents (individuals, companies...), with their own private constraints and preferences, communicating with each other in order to find a solution that maximizes the overall public satisfact ...

2010

A Unified Framework for Location Privacy

Jean-Pierre Hubaux, Julien Freudiger, Reza Shokri

We introduce a novel framework that provides a logical structure for classifying and organizing fundamental components and concepts of location privacy. Our framework models mobile networks and applications, threats, location-privacy preserving mechanisms, ...

2010

Combining Geometric and Appearance Priors for Robust Homography Estimation

Pascal Fua, Vincent Lepetit, Mustafa Özuysal

The homography between pairs of images are typically computed from the correspondence of keypoints, which are established by using image descriptors. When these descriptors are not reliable, either because of repetitive patterns or large amounts of clutter ...

2010

A MAP Approach to Noise Compensation of Speech

Philip Neil Garner

We show that estimation of parameters for the popular Gaussian model of speech in noise can be regularised in a Bayesian sense by use of simple prior distributions. For two example prior distributions, we show that the marginal distribution of the uncorrup ...

Idiap2009

Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Julien Freudiger, Maxime Raya

Pervasive communications bring along new privacy challenges, fueled by the capability of mobile devices to communicate with, and thus "sniff on", each other directly. We design a new mechanism that aims at achieving location privacy in these forthcoming mo ...

2009

Privacy-Preserving Multi-agent Constraint Satisfaction

Boi Faltings, Thomas Léauté

Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context involving multiple agents, and protecting privacy of information among them is of ...

IEEE Computer Society Press2009

A Fast Stroud-Based Collocation Method for Statistically Characterizing EMI/EMC Phenomena on Complex Platforms

Jan Sickmann Hesthaven

A fast stochastic collocation method for statistically characterizing electromagnetic interference and compatibility (EMI/EMC) phenomena on electrically large and loaded platforms is presented. Uncertainties in electromagnetic excitations and/or system geo ...

Institute of Electrical and Electronics Engineers2009

H.264/AVC Video Scrambling for Privacy Protection

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we address the problem of privacy in video surveillance systems. More specifically, we consider the case of H.264/AVC which is the state-of-the-art in video coding. We assume that Regions of Interest (ROI), containing privacy-sensitive infor ...

2008

Privacy Guarantees through Distributed Constraint Satisfaction

Boi Faltings, Adrian Petcu, Thomas Léauté

The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this ...

2008

Privacy Guarantees through Distributed Constraint Satisfaction

Boi Faltings, Adrian Petcu, Thomas Léauté

Abstract. In Distributed Constraint Satisfaction Problems, agents often desire to ﬁnd a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this information. T ...

2008