Security applications of peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using engine signature to detect metamorphic malware
Proceedings of the 4th ACM workshop on Recurring malcode
Detecting targeted attacks using shadow honeypots
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
On the infeasibility of modeling polymorphic shellcode
Proceedings of the 14th ACM conference on Computer and communications security
Opcodes as predictor for malware
International Journal of Electronic Security and Digital Forensics
Proceedings of the 15th ACM conference on Computer and communications security
Automated Log Analysis of Infected Windows OS Using Mechanized Reasoning
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Building a dark piconet upon bluetooth interfaces of computers
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
An email worm vaccine architecture
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
| Hi-index | 754.84 |
A virus is a program that replicates itself by copying its code into other files. A common virus-protection mechanism involves scanning files to detect code patterns of known viruses. We prove that the problem of reliably identifying a bounded-length mutating virus is NP-complete by showing that a virus detector for a certain virus strain can be used to solve the satisfiability problem. The implication of this result is that virus identification methods will be facing increasing strain as virus mutation and hosting strategies mature, and that different protection methods should be developed and employed.