Sébastien Gambs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sébastien Gambs has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Marie-José Huguet
LAAS-CNRS, Université de Toulouse, CNRS, INSA, Toulouse, France
6 shared publications - Heber Hwang Arcolezi
École de Technologie Supérieure
5 shared publications - Julien Ferry
CIRRELT & SCALE‐AI Chair in Data‐Driven Supply Chains, Department of Mathematics and Industrial Engineering Polytechnique Montréal Montréal Canada
5 shared publications - Mohamed Siala
LAAS-CNRS, Université de Toulouse, CNRS, INSA
5 shared publications - Ulrich Aïvodji
Départment d’Informatique, Université du Québec à Montréal, Montreal, QC H2L 2C4, Canada
5 shared publications - Mathieu Cunche
INSA-Lyon, Inria, CITI Lab., Lyon, France
4 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 4988-5022
Quantifying the Privacy of Counterfactuals by Leveraging Membership Inference Attacks Against Synthetic Data
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 4988-5022
Open AccessQuantifying the Privacy of Counterfactuals by Leveraging Membership Inference Attacks Against Synthetic Data
- Open Access
Robust Federated Learning via Byzantine Filtering over Encrypted Updates
Federated Learning (FL) aims to train a collaborative model while preserving data privacy. However, the distributed nature of this approach still raises privacy and security issues, such as the exposure of sensitive data due to inference attacks and the influence of Byzantine behaviors on the trained model. In particular, achieving both secure aggregation and Byzantine resilience remains challenging, as existing solutions often address these aspects independently. In this work, we propose to address these challenges through a novel approach that combines homomorphic encryption for privacy-preserving aggregation with property-inference-inspired meta-classifiers for Byzantine filtering. First, following the property-inference attacks blueprint, we train a set of filtering meta-classifiers on labeled shadow updates, reproducing a diverse ensemble of Byzantine misbehaviors in FL, including backdoor, gradient-inversion, label-flipping and shuffling attacks. The outputs of these meta-classifiers are then used to cancel the Byzantine encrypted updates by reweighting. Second, we propose an automated method for selecting the optimal kernel and the dimensionality hyperparameters with respect to homomorphic inference, aggregation constraints and efficiency over the CKKS cryptosystem. Finally, we demonstrate through extensive experiments the effectiveness of our approach against Byzantine participants on the FEMNIST, CIFAR10, GTSRB, and acsincome benchmarks. More precisely, our SVM filtering achieves accuracies between $90$% and $94$% for identifying Byzantine updates at the cost of marginal losses in model utility and encrypted inference runtimes ranging from $6$ to $24$ seconds and from $9$ to $26$ seconds for an overall aggregation.Open AccessRobust Federated Learning via Byzantine Filtering over Encrypted Updates
Federated Learning (FL) aims to train a collaborative model while preserving data privacy. However, the distributed nature of this approach still raises privacy and security issues, such as the exposure of sensitive data due to inference attacks and the influence of Byzantine behaviors on the trained model. In particular, achieving both secure aggregation and Byzantine resilience remains challenging, as existing solutions often address these aspects independently. In this work, we propose to address these challenges through a novel approach that combines homomorphic encryption for privacy-preserving aggregation with property-inference-inspired meta-classifiers for Byzantine filtering. First, following the property-inference attacks blueprint, we train a set of filtering meta-classifiers on labeled shadow updates, reproducing a diverse ensemble of Byzantine misbehaviors in FL, including backdoor, gradient-inversion, label-flipping and shuffling attacks. The outputs of these meta-classifiers are then used to cancel the Byzantine encrypted updates by reweighting. Second, we propose an automated method for selecting the optimal kernel and the dimensionality hyperparameters with respect to homomorphic inference, aggregation constraints and efficiency over the CKKS cryptosystem. Finally, we demonstrate through extensive experiments the effectiveness of our approach against Byzantine participants on the FEMNIST, CIFAR10, GTSRB, and acsincome benchmarks. More precisely, our SVM filtering achieves accuracies between $90$% and $94$% for identifying Byzantine updates at the cost of marginal losses in model utility and encrypted inference runtimes ranging from $6$ to $24$ seconds and from $9$ to $26$ seconds for an overall aggregation. - 12 October 2025
- Published by Springer Nature
- p. 233-252
Privacy-Preserving Trajectory Data Publication Via Differentially-Private Representation Learning
- 12 October 2025
- Published by Springer Nature
- p. 233-252
Privacy-Preserving Trajectory Data Publication Via Differentially-Private Representation Learning
- 27 September 2025
- Published by Springer Nature
- p. 259-275
P2NIA: Privacy-Preserving Non-iterative Auditing
- 27 September 2025
- Published by Springer Nature
- p. 259-275
P2NIA: Privacy-Preserving Non-iterative Auditing
- Open Access
- 19 September 2025
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XLVIII-4/W, 17-24
LoChain: A Decentralized and Privacy-Preserving Blockchain Protocol for Mobility Data Management
Mobility data has become a strategic asset in urban planning, crisis management and smart city operations. However, centralized systems for mobility tracking raise severe privacy concerns as they have the ability to directly link individuals to their movements. To address these issues, we propose LoChain, a decentralized protocol that enables the privacy-preserving collection and processing of mobility data based on blockchain technology. More precisely, LoChain replaces precise coordinates with standardized geoaddresses, associate user movements to disposable identities, communication them via Tor routing and stores the resulting data across a decentralized network built on Hyperledger Fabric. The system also employs a novel geopool and multi-channel architecture to simulate sharding, enabling localized data ingestion, inter-district communication and global statistical aggregation without compromising individual privacy. Localized position obfuscation and pseudo-random identity purging are used to further prevent reidentification. A proof-of-concept prototype, including an Android app, blockchain backend and visualization layer was developed and evaluated using synthetic data from 10,000 virtual users. The experiments results obtained from the simulation highlight the LoChain’s ability to preserve user privacy while maintaining analytical utility. Finally, we also introduce an incentive model as well as a decentralized governance structure to ensure long-term scalability, regulatory compliance and participatory control.
- 19 September 2025
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XLVIII-4/W, 17-24
Open AccessLoChain: A Decentralized and Privacy-Preserving Blockchain Protocol for Mobility Data Management
Mobility data has become a strategic asset in urban planning, crisis management and smart city operations. However, centralized systems for mobility tracking raise severe privacy concerns as they have the ability to directly link individuals to their movements. To address these issues, we propose LoChain, a decentralized protocol that enables the privacy-preserving collection and processing of mobility data based on blockchain technology. More precisely, LoChain replaces precise coordinates with standardized geoaddresses, associate user movements to disposable identities, communication them via Tor routing and stores the resulting data across a decentralized network built on Hyperledger Fabric. The system also employs a novel geopool and multi-channel architecture to simulate sharding, enabling localized data ingestion, inter-district communication and global statistical aggregation without compromising individual privacy. Localized position obfuscation and pseudo-random identity purging are used to further prevent reidentification. A proof-of-concept prototype, including an Android app, blockchain backend and visualization layer was developed and evaluated using synthetic data from 10,000 virtual users. The experiments results obtained from the simulation highlight the LoChain’s ability to preserve user privacy while maintaining analytical utility. Finally, we also introduce an incentive model as well as a decentralized governance structure to ensure long-term scalability, regulatory compliance and participatory control.
- Open Access
- 30 August 2025
- Published by Elsevier in Information and Software Technology
- Vol. 188
Representation-based fairness evaluation and bias correction robustness assessment in neural networks
- 30 August 2025
- Published by Elsevier in Information and Software Technology
- Vol. 188
Open AccessRepresentation-based fairness evaluation and bias correction robustness assessment in neural networks
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 6253-6254
Responsible AI Day
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 6253-6254
Open AccessResponsible AI Day
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 47-58
GRAND : Graph Reconstruction from Potential Partial Adjacency and Neighborhood Data
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 47-58
Open AccessGRAND : Graph Reconstruction from Potential Partial Adjacency and Neighborhood Data
- Open Access
- 1 July 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (3) , 494-526
WaKA: Data Attribution using K-Nearest Neighbors and Membership Privacy Principles
In this paper, we introduce WaKA (Wasserstein K-nearest neighbors Attribution), a novel attribution method that leverages principles from the LiRA (Likelihood Ratio Attack) framework and k-nearest neighbors classifiers (k-NN). WaKA efficiently measures the contribution of individual data points to the model’s loss distribution, analyzing every possible k-NN that can be constructed using the training set, without requiring to sample subsets of the training set. WaKA is versatile and can be used a posteriori as a membership inference attack (MIA) to assess privacy risks or a priori for privacy influence measurement and data valuation. Thus, WaKA can be seen as bridging the gap between data attribution and membership inference attack (MIA) by providing a unified framework to distinguish between a data point’s value and its privacy risk. For instance, we have shown that self-attribution values are more strongly correlated with the attack success rate than the contribution of a point to the model generalization. WaKA’s different usages were also evaluated across diverse real-world datasets, demonstrating performance very close to LiRA when used as an MIA on k-NN classifiers, but with greater computational efficiency. Additionally, WaKA shows greater robustness than Shapley Values for data minimization tasks (removal or addition) on imbalanced datasets.
- 1 July 2025
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2025 (3) , 494-526
Open AccessWaKA: Data Attribution using K-Nearest Neighbors and Membership Privacy Principles
In this paper, we introduce WaKA (Wasserstein K-nearest neighbors Attribution), a novel attribution method that leverages principles from the LiRA (Likelihood Ratio Attack) framework and k-nearest neighbors classifiers (k-NN). WaKA efficiently measures the contribution of individual data points to the model’s loss distribution, analyzing every possible k-NN that can be constructed using the training set, without requiring to sample subsets of the training set. WaKA is versatile and can be used a posteriori as a membership inference attack (MIA) to assess privacy risks or a priori for privacy influence measurement and data valuation. Thus, WaKA can be seen as bridging the gap between data attribution and membership inference attack (MIA) by providing a unified framework to distinguish between a data point’s value and its privacy risk. For instance, we have shown that self-attribution values are more strongly correlated with the attack success rate than the contribution of a point to the model generalization. WaKA’s different usages were also evaluated across diverse real-world datasets, demonstrating performance very close to LiRA when used as an MIA on k-NN classifiers, but with greater computational efficiency. Additionally, WaKA shows greater robustness than Shapley Values for data minimization tasks (removal or addition) on imbalanced datasets.