Felice Franchini

Mr. Felice Franchini

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 April 2025
Verified
Book Chapter
Closed access
PDF file
GSGiuseppe Spillo
Giuseppe Spillo
AVAlberto Gaetano Valerio
Alberto Gaetano Valerio
FFFelice Franchini
Felice Franchini
AFAllegra De Filippo
Allegra De Filippo
Cataldo MustoCataldo Musto
Cataldo Musto
Giovanni SemeraroGiovanni Semeraro
Giovanni Semeraro

15 May 2026 in Cybersecurity
Verified
Journal Article
Open access
PDF file
MAMalik AL-Essa
Malik AL-Essa
FFFelice Franchini
Felice Franchini
Stefano GalantucciStefano Galantucci
Stefano Galantucci
MIMuhammad Imran
Muhammad Imran
GPGiuseppe Pirlo
Giuseppe Pirlo
Adversarial machine learning has exposed critical vulnerabilities in Artificial Intelligence-based Windows Portable Executable (PE) malware detection. A well-crafted small perturbation to a PE malware binary can cause it to be misclassified as goodware. Adversarial Training (AT) is one of the most effective defenses; however, it is not always sufficient alone and often suffers from the robustness–accuracy trade-off. This study proposes Adversarial Training with Synthetic Augmentation (ATS), a novel defense methodology that augments unrealistic synthetic adversarial examples into the standard adversarial training, produced using the Conditional Tabular GAN (CTGAN). The robustness and resilience of Random Forest, Light Gradient Boosting Machine (LightGBM), and Multilayer Perceptron (MLP) classifiers were evaluated against five realistic Windows PE adversarial attacks: Full DOS, EXTEND, SHIFT, FGSM-padding, and GAMMA. Results show that the ATS methodology consistently outperformed AT in enhancing robustness across all attacks and classifiers while maintaining or improving clean accuracy and F1-score. SHAP-based interpretability analysis further reveals that ATS reduces dependence on attack-sensitive low-level features and increases attention to stable PE features. Overall, ATS provides a model-agnostic enhancement to standard AT, effectively reducing false negatives without compromising clean accuracy.

13 August 2026 in Future Internet
Verified
Journal Article
Open access
PDF file
MIMuhammad Imran
Muhammad Imran
MAMalik AL-Essa
Malik AL-Essa
FFFelice Franchini
Felice Franchini
GPGiuseppe Pirlo
Giuseppe Pirlo
Machine Learning (ML)-based malware detectors perform exceptionally well on standard benchmarks, but their robustness to evasive malware remains fragile. On EMBER2024, strong tree-based models achieve high accuracy on clean test sets yet miss a large number of evasive Windows PE samples. Through SHAP-based explainability, matched error comparisons, feature-family analysis, and margin diagnostics on the validation split, we identify consistent attribution and decision-margin differences between baseline true negatives and false negatives. We further show that false negatives occur at different decision depths, including both near-boundary cases and samples misclassified with high benign confidence. We propose C-GUARD, a context-adaptive conformal gated detector that preserves the optimized high-performing baseline while selectively invoking an auxiliary rescue detector on a targeted subset of baseline negative predictions. C-GUARD combines out-of-fold rescue learning to distinguish baseline false negatives from true negatives with adaptive gating under an explicit false-positive budget. A one-sided intervention rule preserves all baseline malware decisions. On the EMBER2024 standard test set, C-GUARD recovers 178 additional malware samples at the cost of 82 additional false positives. On the evasive challenge set, it recovers 17 additional evasive malware samples.

14 April 2026 in Cryptography
Verified
Journal Article
Open access
PDF file
ACAlessandro Caniglia
Alessandro Caniglia
FFFelice Franchini
Felice Franchini
Stefano GalantucciStefano Galantucci
Stefano Galantucci
GPGiuseppe Pirlo
Giuseppe Pirlo
GSGianfranco Semeraro
Gianfranco Semeraro
Classical approaches to cryptography exhibit several limitations when applied to scenarios involving more than two users. The One-Time User Key (OTUK) meta-cryptographic model addresses these limitations by enabling multi-user encryption that is flexible, applicable to any cryptographic algorithm, and designed for systematic deployment without compromising system security. Each user possesses an individual key from which One-Time keys are derived; these keys feed a secret-sharing function (ω) that establishes the multi-user encrypted channel. In this paper, we present a polynomial-based implementation of the ω function under a (1,n) threshold model. The generated polynomial has roots at points corresponding to valid user keys and is mapped to the real encryption key. We provide a formal threat model, pseudocode for the complete protocol, and a detailed computational analysis across the numerical domains N, Z, and R. Furthermore, we present experimental benchmarks measuring encryption/decryption speed, scalability up to 30 users, parameter sensitivity, and a comparative evaluation against Shamir’s Secret Sharing scheme. A systematic security analysis examines partial-information attacks, derivative-root distance margins, and brute-force resistance, demonstrating that the effective security margin remains above 245 bits for configurations of up to 30 users with 256-bit keys. The proposed method offers a concrete, efficient, and secure foundation for multi-user encrypted communication in domains such as IoT, public administration, and e-health.


11 November 2026 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
FFFelice Franchini
Felice Franchini
GPGiuseppe Pirlo
Giuseppe Pirlo
LSLucia Sarcinella
Lucia Sarcinella
GSGianfranco Semeraro
Gianfranco Semeraro