Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Sadegh M. Milajerdi"'
Publikováno v:
CCS
Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might have compromised an enterprise network for a long time without being discovered. To have a more effective analysis, CTI open standards have incorporated desc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3e17fc7b72da07e0b2a1d7fa9e60b79
Publikováno v:
IEEE Symposium on Security and Privacy
In this paper, we present HOLMES, a system that implements a new approach to the detection of Advanced and Persistent Threats (APTs). HOLMES is inspired by several case studies of real-world APTs that highlight some common goals of APT actors. In a n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ea341135a220645152bf7bf27cd1025
http://arxiv.org/abs/1810.01594
http://arxiv.org/abs/1810.01594
Autor:
Sadegh M. Milajerdi, Mehdi Kharrazi
Publikováno v:
Journal of Systems and Software. 103:53-61
Path selection algorithm which considers bandwidth, reliability, propagation delay.Double the performance when compared to the default path selection used in Tor.Paths created to the average geo-location, hence more stable paths and less delay.No cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83c1cbd90cb1e3b810eea2feb81426ee
https://doi.org/10.1016/j.jss.2015.01.002
https://doi.org/10.1016/j.jss.2015.01.002
Publikováno v:
Information Systems Security ISBN: 9783030051709
ICISS
ICISS
Kernel audit logs are an invaluable source of information in the forensic investigation of a cyber-attack. However, the coarse granularity of dependency information in audit logs leads to the construction of huge attack graphs which contain false or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b75c4d5ae3582b60c8483ca559555be
https://doi.org/10.1007/978-3-030-05171-6_6
https://doi.org/10.1007/978-3-030-05171-6_6
Publikováno v:
KDD
Given a stream of heterogeneous graphs containing different types of nodes and edges, how can we spot anomalous ones in real-time while consuming bounded memory? This problem is motivated by and generalizes from its application in security to host-le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e44988ec4a4500ca936e8afe8d31d72f
https://doi.org/10.1145/2939672.2939783
https://doi.org/10.1145/2939672.2939783