Fabio Roli
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
Fabio Roli has a total of 233 co-authors. Here are the top co-authors by number of shared publications:
- Battista Biggio
University of Cagliari
50 shared publications - Ambra Demontis
University of Cagliari
25 shared publications - Giorgio Fumera
University of Cagliari
22 shared publications - Gian Luca Marcialis
University of Cagliari, Cagliari, Italy
21 shared publications - Giorgio Giacinto
University of Cagliari
17 shared publications - Antonio Emanuele Cinà
University of Genoa
16 shared publications
Latest Publications
- Open Access
- 12 November 2026
- Published by Elsevier in Information Sciences
Adversarial examples beyond spurious features: An experimental study
- 12 November 2026
- Published by Elsevier in Information Sciences
Open AccessAdversarial examples beyond spurious features: An experimental study
- Open Access
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (11) , 13704-13747
Trustworthy Data- and ML-Ops for Intelligent Transportation Systems and Logistics
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (11) , 13704-13747
Open AccessTrustworthy Data- and ML-Ops for Intelligent Transportation Systems and Logistics
- 15 September 2026
- Published by Springer Nature
- p. 506-518
Instance Reweighting for Adversarial Training Helps Only Against the Training Attack
- 15 September 2026
- Published by Springer Nature
- p. 506-518
Instance Reweighting for Adversarial Training Helps Only Against the Training Attack
- 15 September 2026
- Published by Springer Nature
- p. 445-457
ADP: Activation-Driven Neuron Pruning
- Open Access
- 6 September 2026
- Published by Springer Nature in Complex & Intelligent Systems
Fair backward compatibility: definitions, theoretical framework, and empirical results
- 6 September 2026
- Published by Springer Nature in Complex & Intelligent Systems
Open AccessFair backward compatibility: definitions, theoretical framework, and empirical results
- Open Access
- 7 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 29 (3) , 1-30
Robust Large-Scale Detection of Living-Off-the-Land Reverse Shells via Data Synthesis
Living-off-the-land (LOTL) techniques, which exploit legitimate system utilities to execute malicious commands, pose significant challenges to cyber-threat detection by blending with benign behavior. Current state-of-the-art machine learning (ML) detection methods suffer from two critical limitations: (1) a need for large-scale datasets that capture LOTL behaviors, essential for detection at low false-positive rates (FPR) and high true-positive rates (TPR), and (2) a lack of adversarial manipulation evaluations, despite the inherent presence of adaptive attackers in cybersecurity contexts. To address these challenges, we introduce a novel, cyber-security focused data synthesis (DS) framework that augments malicious LOTL samples by combining threat intelligence with legitimate baselines from enterprise networks. We evaluate our framework in a large-scale production environment, focusing on the detection of Linux LOTL reverse shells. The resulting dataset and models—collectively referred to as QuasarNix —enable ML detectors that detect roughly 60% of malicious reverse shells at an industry-grade FPR = 10 -6 , whereas non-augmented baselines remain effectively blind at this operating point. We demonstrate that unprotected ML models remain vulnerable to black-box evasion attacks. To counteract these risks, we incorporate adversarial training into our DS framework, enhancing the robustness of our LOTL detection models. Through an explainability analysis, we confirm that QuasarNix provide detection engineers with evidence-based attribution, aligning with cybersecurity domain expertise. To foster reproducibility, we publicly release our framework implementation, 1 synthesized dataset, 2 and pre-trained models. 3
- 7 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 29 (3) , 1-30
Open AccessRobust Large-Scale Detection of Living-Off-the-Land Reverse Shells via Data Synthesis
Living-off-the-land (LOTL) techniques, which exploit legitimate system utilities to execute malicious commands, pose significant challenges to cyber-threat detection by blending with benign behavior. Current state-of-the-art machine learning (ML) detection methods suffer from two critical limitations: (1) a need for large-scale datasets that capture LOTL behaviors, essential for detection at low false-positive rates (FPR) and high true-positive rates (TPR), and (2) a lack of adversarial manipulation evaluations, despite the inherent presence of adaptive attackers in cybersecurity contexts. To address these challenges, we introduce a novel, cyber-security focused data synthesis (DS) framework that augments malicious LOTL samples by combining threat intelligence with legitimate baselines from enterprise networks. We evaluate our framework in a large-scale production environment, focusing on the detection of Linux LOTL reverse shells. The resulting dataset and models—collectively referred to as QuasarNix —enable ML detectors that detect roughly 60% of malicious reverse shells at an industry-grade FPR = 10 -6 , whereas non-augmented baselines remain effectively blind at this operating point. We demonstrate that unprotected ML models remain vulnerable to black-box evasion attacks. To counteract these risks, we incorporate adversarial training into our DS framework, enhancing the robustness of our LOTL detection models. Through an explainability analysis, we confirm that QuasarNix provide detection engineers with evidence-based attribution, aligning with cybersecurity domain expertise. To foster reproducibility, we publicly release our framework implementation, 1 synthesized dataset, 2 and pre-trained models. 3
- 13 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6427-6440
Face Presentation Attack Detection by Exploiting Prior Knowledge of Region Relationships
Face recognition systems have been widely deployed in mobile devices for user authentication and payment applications. However, these biometric systems remain vulnerable to face presentation attacks, posing significant security risks. In recent years, numerous countermeasures have been proposed, with analysis of differences between bona fide and attack presentations being a commonly adopted strategy. Nevertheless, the variations in image attributes and region movements have not been thoroughly explored. In attack images, the textures of the facial region and the background tend to be more similar, while local regions often exhibit more consistent directions of movement compared to bona fide presentations. Motivated by this observation, we propose a novel face presentation attack detection method that leverages prior knowledge of region relationships. Specifically, each input face image sequence is first divided into small patches, which are then processed by a pre-trained $TimeSformer$ network utilizing divided time and space attention mechanisms to extract deep features. Two metrics—$Cosine$ similarity and mean squared error ($MSE$)—are subsequently employed to measure the texture similarity and movement relationships of the regions of interest. During the inference phase, these measurements are fused to distinguish bona fide from attack presentations. Extensive ablation and comparison experiments, conducted on six face presentation attack detection (PAD) databases (i.e., Idiap Replay-Attack, CASIA-MFSD, OULU-NPU, MSU-MFSD, 3DMAD, and HKBU-MARs V1+), demonstrate that our method achieves superior detection performance, significantly improving precision over state-of-the-art approaches in most experimental settings.
- 13 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6427-6440
Face Presentation Attack Detection by Exploiting Prior Knowledge of Region Relationships
Face recognition systems have been widely deployed in mobile devices for user authentication and payment applications. However, these biometric systems remain vulnerable to face presentation attacks, posing significant security risks. In recent years, numerous countermeasures have been proposed, with analysis of differences between bona fide and attack presentations being a commonly adopted strategy. Nevertheless, the variations in image attributes and region movements have not been thoroughly explored. In attack images, the textures of the facial region and the background tend to be more similar, while local regions often exhibit more consistent directions of movement compared to bona fide presentations. Motivated by this observation, we propose a novel face presentation attack detection method that leverages prior knowledge of region relationships. Specifically, each input face image sequence is first divided into small patches, which are then processed by a pre-trained $TimeSformer$ network utilizing divided time and space attention mechanisms to extract deep features. Two metrics—$Cosine$ similarity and mean squared error ($MSE$)—are subsequently employed to measure the texture similarity and movement relationships of the regions of interest. During the inference phase, these measurements are fused to distinguish bona fide from attack presentations. Extensive ablation and comparison experiments, conducted on six face presentation attack detection (PAD) databases (i.e., Idiap Replay-Attack, CASIA-MFSD, OULU-NPU, MSU-MFSD, 3DMAD, and HKBU-MARs V1+), demonstrate that our method achieves superior detection performance, significantly improving precision over state-of-the-art approaches in most experimental settings.
- Open Access
- 22 January 2026
- Published by Elsevier in Information Sciences
- Vol. 738
Sonic: Fast and transferable data poisoning on clustering algorithms
- 22 January 2026
- Published by Elsevier in Information Sciences
- Vol. 738
Open AccessSonic: Fast and transferable data poisoning on clustering algorithms