DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sungjin | ko |
dc.contributor.author | Kang, Brent Byunghoon | ko |
dc.date.accessioned | 2023-07-05T02:07:06Z | - |
dc.date.available | 2023-07-05T02:07:06Z | - |
dc.date.created | 2023-06-08 | - |
dc.date.created | 2023-06-08 | - |
dc.date.issued | 2018-08 | - |
dc.identifier.citation | 14th International EAI Conference on Security and Privacy in Communication Networks, SecureComm 2018, pp.416 - 432 | - |
dc.identifier.issn | 1867-8211 | - |
dc.identifier.uri | http://hdl.handle.net/10203/310302 | - |
dc.description.abstract | Since an exploit kit (EK) was first developed, an increasing number of attempts has been made to infect users’ PCs by transmitting malware via EKs. To tackle such malware distribution, we propose herein an enhanced similarity-matching technique that determines whether the test sets are similar to the pattern sets in which the structural properties of EKs are defined. A key characteristic of our similarity-matching technique is that, unlike typical pattern-matching, it can detect isomorphic variants derived from EKs. In an experiment involving 36,950 datasets, our similarity-matching technique provides a TP rate of 99.9% and an FP rate of 0.001% with a performance of 0.003 s/page. | - |
dc.language | English | - |
dc.publisher | Springer Verlag | - |
dc.title | FriSM: Malicious exploit kit detection via feature-based string-similarity matching | - |
dc.type | Conference | - |
dc.identifier.wosid | 000769954500023 | - |
dc.identifier.scopusid | 2-s2.0-85059692784 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 416 | - |
dc.citation.endingpage | 432 | - |
dc.citation.publicationname | 14th International EAI Conference on Security and Privacy in Communication Networks, SecureComm 2018 | - |
dc.identifier.conferencecountry | SI | - |
dc.identifier.conferencelocation | Singapore | - |
dc.identifier.doi | 10.1007/978-3-030-01701-9_23 | - |
dc.contributor.localauthor | Kang, Brent Byunghoon | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.