Concept

Data re-identification

Publications associées (23)

Fast refacing of MR images with a generative neural network lowers re-identification risk and preserves volumetric consistency

Jean-Philippe Thiran, Tobias Kober, Bénédicte Marie Maréchal, Jonas Richiardi

With the rise of open data, identifiability of individuals based on 3D renderings obtained from routine structural magnetic resonance imaging (MRI) scans of the head has become a growing privacy concern. To protect subject privacy, several algorithms have ...

Wiley2024

Differentially private multi-agent constraint optimization

Boi Faltings, Sankarshan Damle, Sujit Prakash Gujar, Aleksei Triastcyn

Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...

Dordrecht2024

PRO-Face C: Privacy-Preserving Recognition of Obfuscated Face via Feature Compensation

Touradj Ebrahimi, Lin Yuan, Xiao Pu, Yao Zhang, Hongbo Li

The advancement of face recognition technology has delivered substantial societal advantages. However, it has also raised global privacy concerns due to the ubiquitous collection and potential misuse of individuals' facial data. This presents a notable par ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Differentially Private Multi-Agent Constraint Optimization

Boi Faltings, Sankarshan Damle, Sujit Prakash Gujar, Aleksei Triastcyn

Several optimization scenarios involve multiple agents that desire to protect the privacy of their preferences. There are distributed algorithms for constraint optimization that provide improved privacy protection through secure multiparty computation. How ...

ACM2022

Utility/privacy trade-off as regularized optimal transport

Etienne Patrice Boursier

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two objectives are antagonistic and leaking this information by taking full advant ...

SPRINGER HEIDELBERG2022

TEE-based decentralized recommender systems: The raw data sharing redemption

Anne-Marie Kermarrec, Rafael Pereira Pires, Akash Balasaheb Dhasade, Nevena Dresevic

Recommenders are central in many applications today. The most effective recommendation schemes, such as those based on collaborative filtering (CF), exploit similarities between user profiles to make recommendations, but potentially expose private data. Fe ...

2022

Generating Higher-Fidelity Synthetic Datasets with Privacy Guarantees

Boi Faltings, Aleksei Triastcyn

We consider the problem of enhancing user privacy in common data analysis and machine learning development tasks, such as data annotation and inspection, by substituting the real data with samples from a generative adversarial network. We propose employing ...

MDPI2022

Open-Set Person Re-Identification through Error Resilient Recurring Gallery Building

Touradj Ebrahimi, Evgeniy Upenik

In person re-identification, individuals must be correctly identified in images that come from different cameras or are captured at different points in time. In the open-set case, the above needs be achieved for people who have not been previously recognis ...

IEEE2021

Private and Secure Distributed Learning

Georgios Damaskinos

The ever-growing number of edge devices (e.g., smartphones) and the exploding volume of sensitive data they produce, call for distributed machine learning techniques that are privacy-preserving. Given the increasing computing capabilities of modern edge de ...

EPFL2020

Generating Higher-Fidelity Synthetic Datasets with Privacy Guarantees

Boi Faltings, Aleksei Triastcyn

This paper considers the problem of enhancing user privacy in common machine learning development tasks, such as data annotation and inspection, by substituting the real data with samples form a generative adversarial network. We propose employing Bayesian ...

2020

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