Platon Kotzias

Platon Kotzias

Auto-generated profile, based on publicly available information

Platon Kotzias

BforeAI

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
15 November 2023
Verified
Conference Paper
Open access
SDSavino Dambra
Savino Dambra
YHYufei Han
Yufei Han
SASimone Aonzo
Simone Aonzo
PKPlaton Kotzias
Platon Kotzias
AVAntonino Vitale
Antonino Vitale
LBLeyla Bilge
Leyla Bilge
Many studies have proposed machine-learning (ML) models for malware detection and classification, reporting an almost-perfect performance. However, they assemble ground-truth in different ways, use diverse static- and dynamic-analysis techniques for feature extraction, and even differ on what they consider a malware family. As a consequence, our community still lacks an understanding of malware classification results: whether they are tied to the nature and distribution of the collected dataset, to what extent the number of families and samples in the training dataset influence performance, and how well static and dynamic features complement each other. This work sheds light on those open questions by investigating the impact of datasets, features, and classifiers on ML-based malware detection and classification. For this, we collect the largest balanced malware dataset so far with 67k samples from 670 families (100 samples each), and train state-of-the-art models for malware detection and family classification using our dataset. Our results reveal that static features perform better than dynamic features, and that combining both only provides marginal improvement over static features. We discover no correlation between packing and classification accuracy, and that missing behaviors in dynamically-extracted features highly penalise their performance. We also demonstrate how a larger number of families to classify makes the classification harder, while a higher number of samples per family increases accuracy. Finally, we find that models trained on a uniform distribution of samples per family better generalize on unseen data.

4 December 2023
Verified
Conference Paper
Open access
PKPlaton Kotzias
Platon Kotzias
KRKevin Roundy
Kevin Roundy
MPMichalis Pachilakis
Michalis Pachilakis
ISIskander Sanchez-Rola
Iskander Sanchez-Rola
LBLeyla Bilge
Leyla Bilge
The Better Business Bureau ranked online e-commerce scams as the top consumer threat for 2022. Our measurements of real consumer devices confirm that e-commerce scams receive large traffic volumes, a total of 6.3M visits during seven months. In this work, we study e-commerce scams in depth and design a detection classifier that combines novel features that target salient characteristics of e-commerce scam websites and features for detecting malicious and scam domains proposed by prior work. In addition, we specify a method for automatically creating reliable ground-truth sets that are an order of magnitude larger than that of prior work. We use this data set to evaluate the classifier and achieve a high 0.973 F1-score (Prec: 0.988, Rec: 0.959). In a best-effort comparison, we demonstrate that our classifier outperforms the F-1 score of the prior art by 11% and that our novel features offer an F1-score boost of 4.3% over the features used in the prior art. In addition, we deploy our classifier in a real-world setting, analyze over 760K e-shops visited by real users, and identify 10% of those as e-commerce scams. We demonstrate that the classifier has a low False Positive rate in real-world settings and can protect over 176K users in one week.

18 October 2025
Verified
Book Chapter
Closed access
PDF file
AVAntonino Vitale
Antonino Vitale
SASimone Aonzo
Simone Aonzo
SDSavino Dambra
Savino Dambra
NRNanda Rani
Nanda Rani
LILorenzo Ippolito
Lorenzo Ippolito
DBDavide Balzarotti
Davide Balzarotti