@article {Houmz2021, title = {Detecting the impact of software vulnerability on attacks: A case study of network telescope scans}, journal = {Journal of Network and Computer Applications}, volume = {195}, year = {2021}, note = {cited By 1}, abstract = {Network scanning is one of the first steps in gathering information about a target before launching attacks. It is used to scan for vulnerable devices and exposed services in order to exploit them. Such exploits can result in data breaches or network disruption, which can be very costly for organizations. There are many factors, including technical and non-technical, affecting the volume of scanning activities. In this paper, we study the impact of vulnerability disclosure on the volume of scans over time and propose a machine learning-based approach to predict this impact. We conducted a comprehensive data collection of network scans from two network telescopes hosted in different countries, as well as the disclosed vulnerabilities from 2014 to 2019. We then designed a set of features to characterize the disclosed vulnerabilities and used several classifiers to predict whether a vulnerability will impact the volume of daily scans. The resulting classifier achieves over 85\% accuracy in predicting the impact. In addition, we performed an analysis of the key characteristics of vulnerabilities that directly affect scanning activities. Our findings show that this approach is able to classify vulnerabilities that have an impact on network scans. The implementation of our model and validation tests proved the efficiency of the selected features, as well as the robustness of our model to classify vulnerabilities{\textquoteright} impact on scans. {\textcopyright} 2021 Elsevier Ltd}, keywords = {Case-studies, Classification algorithm, CVE, Forecasting, Machine learning, Network scan, Network scanning, Network security, Network telescopes, NVD, OR-networks, Scanning, Software vulnerabilities, Telescopes, Times series}, doi = {10.1016/j.jnca.2021.103230}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85116335984\&doi=10.1016\%2fj.jnca.2021.103230\&partnerID=40\&md5=1d7f8d5d4111761b27fc93badc70f925}, author = {Houmz, A. and Mezzour, G. and Zkik, K. and Ghogho, M. and Benbrahim, H.} } @conference {Zakroum2018175, title = {Exploratory data analysis of a network telescope traffic and prediction of port probing rates}, booktitle = {2018 IEEE International Conference on Intelligence and Security Informatics, ISI 2018}, year = {2018}, pages = {175-180}, doi = {10.1109/ISI.2018.8587323}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061067648\&doi=10.1109\%2fISI.2018.8587323\&partnerID=40\&md5=76f77a31025e393df1d23b123bcb8dee}, author = {Zakroum, M. and Houmz, A. and Ghogho, M. and Mezzour, G. and Lahmadi, A. and Francois, J. and Koutbi, M.E.} } @conference {Mezouary2015, title = {PRoPHET-RAIP5: A new approach to secure routing in wireless sensor networks}, booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015}, year = {2015}, note = {cited By 0}, abstract = {Probabilistic routing in wireless sensor network (WSNs) use the mobility history when making a forwarding decision. This type of routing provides a very rapid development and new perspectives in WSNs. However, there are several constraints and challenges to overcome the security problems. In this paper, we propose a security solution based on the RAID5 technology and a multi-path routing, to develop a protective mechanism against the various attacks in mobile WSNs. To demonstrate our concept, we have implemented this solution on Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET). We have compared our new protocol (PRoPHET-RAIP5) with standard PRoPHET to enhance security parameters. {\textcopyright} 2015 IEEE.}, doi = {10.1109/WINCOM.2015.7381307}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965029803\&doi=10.1109\%2fWINCOM.2015.7381307\&partnerID=40\&md5=f34a0e46149201d4fc9429b7732f9c7b}, author = {Mezouary, R.E. and Houmz, A. and Jalil, J. and Koutbi, M.E.} }