Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Arun Lakhotia"'
Publikováno v:
Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f93218303221fe03f06b9bfa660a7a7
https://doi.org/10.1145/3508398.3511508
https://doi.org/10.1145/3508398.3511508
Publikováno v:
Malware Analysis Using Artificial Intelligence and Deep Learning ISBN: 9783030625818
Many types of malicious software are controlled from an attacker’s command and control (C2) servers. Anti-virus organizations seek to defeat malware attacks by requesting removal of C2 server Domain Name Server (DNS) records. As a result, the life
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe3cd642276ff086d98de1382013e7f9
https://doi.org/10.1007/978-3-030-62582-5_13
https://doi.org/10.1007/978-3-030-62582-5_13
Publikováno v:
Electronics
Volume 9
Issue 7
Electronics, Vol 9, Iss 1163, p 1163 (2020)
Volume 9
Issue 7
Electronics, Vol 9, Iss 1163, p 1163 (2020)
Finding changed and similar functions between a pair of binaries is an important problem in malware attribution and for the identification of new malware capabilities. This paper presents a new technique called Function Similarity using Family Contex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c824b9f35d5ef2504861ed43a22fc9b
Publikováno v:
CyberSA
Malware, like any other software, is developed iteratively and improved in incremental versions over a long period of time. Malware economics requires amortizing the cost of malware development over several attacks. Thus, the malware code persists th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41ad5f7f0da5990cfa511b6ee503f163
https://doi.org/10.1109/cybersa.2018.8551388
https://doi.org/10.1109/cybersa.2018.8551388
Publikováno v:
POPL
We introduce a model for mixed syntactic/semantic approximation of programs based on symbolic finite automata (SFA). The edges of SFA are labeled by predicates whose semantics specifies the denotations that are allowed by the edge. We introduce the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3589ea8526c37fe1c3344de2b7f5ff28
https://doi.org/10.1145/2775051.2676986
https://doi.org/10.1145/2775051.2676986
Publikováno v:
Journal of Computer Virology and Hacking Techniques. 9:137-157
One method malware authors use to defeat detection of their programs is to use morphing engines to rapidly generate a large number of variants. Inspired by previous works in author attribution of natural language text, we investigate a problem of att
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2496e5013feb0e197eeba4f1d2623fb
https://doi.org/10.1007/s11416-013-0183-6
https://doi.org/10.1007/s11416-013-0183-6
Publikováno v:
Journal of Computer Virology and Hacking Techniques. 9:109-123
VILO is a lazy learner system designed for malware classification and triage. It implements a nearest neighbor (NN) algorithm with similarities computed over Term Frequency $$\times $$ Inverse Document Frequency (TFIDF) weighted opcode mnemonic permu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21cf8402ebf026dab5283fa31b559707
https://doi.org/10.1007/s11416-013-0178-3
https://doi.org/10.1007/s11416-013-0178-3
Publikováno v:
Journal in Computer Virology. 8:73-84
Programmers often identify functionality within a compiled program that they wish they could reuse in a manner other than that intended by the program's original authors. The traditional approach to reusing pre-existing functionality contained within
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b131300db3e310bdc03e165b8514a4fe
https://doi.org/10.1007/s11416-012-0167-y
https://doi.org/10.1007/s11416-012-0167-y
Publikováno v:
International Journal of Web Information Systems. 7:152-182
PurposeAccess to related information is a key requirement for exploratory search. The purpose of this research is to understand where related information may be found and how it may be explored by users.Design/methodology/approachEarlier research pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84e9e1aa6eacba0f6f28dc0564de0657
https://doi.org/10.1108/17440081111141781
https://doi.org/10.1108/17440081111141781
Publikováno v:
Higher-Order and Symbolic Computation. 23:275-313
Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of `valid' paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37399f126bf41883972b33f6d33c59cf
https://doi.org/10.1007/s10990-011-9080-1
https://doi.org/10.1007/s10990-011-9080-1