Reliable identification of bounded-length viruses is NP-complete

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 280-284

  Spinellis, Diomidis ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Buffer overflow; Complexity; Detection; Identification; Mutation; NP complete; Security; Virus

Indexed keywords

CODES (SYMBOLS); COMPUTER VIRUSES; SECURITY OF DATA;

BUFFER OVERFLOW;

COMPUTATIONAL COMPLEXITY;

EID: 0037269111     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806137     Document Type: Article

References (19)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA Freeman, 1979.
2. C.E. Landwehr, A. R. Bull, J. P. McDermott, and W. S. Choi, "A taxonomy of computer program security flaws," ACM Comput. Surv., vol. 26, no. 3, pp. 211-254, Sept. 1994.
3. P. J. Denning, "Computer viruses," Amer. Scientist, pp. 236-238, May-June 1988.
4. F. Cohen, "Computer viruses: Theory and experiments," Comput. Security, vol. 6, no. 1, pp. 22-35, Feb. 1987.
5. E. H. Spafford, K. A. Heaphy, and D. J. Ferbrache, "A computer virus primer," in Computers Under Attack: Intruders, Worms, and Viruses, P. J. Denning, Ed. Reading, MA: Addison-Wesley, 1990, ch. 20, pp. 316-355.
6. V. Prevelakis and D. Spinellis, "Sandboxing applications," in USENIX 2001 Technical Conf. Proc.: FreeNIX Track. Boston, MA: Usenix Assoc., June 2001.
7. P. K. Singh and A. Lakhotia, "Analysis and detection of computer viruses and worms: An annotated bibliography," ACM SIGPLAN Notices, vol. 37, no. 2, pp. 29-35, Feb. 2002.
8. R. Rivest, "RFC 1321: The MD5 message-digest algorithm," Status: INFORMATIONAL, Apr. 1992.
9. K. L. Thompson, "Reflections on trusting trust," Commun. ACM, vol. 27, no. 8, pp, 761-763, Aug. 1984.
10. T. Duff, "Experience with viruses on UNIX systems," Computing Syst., vol. 2, no. 2, pp. 155-171, Spring 1989.
11. M. D. McIlroy, "Virology 101," Computing Syst., vol. 2, no. 2, pp. 173-184, Spring 1989.
12. F. Perriot, P. Ferric, and P. Ször. (2002, June) W32/Simile. [Online]. Available: http://www.virusbtn.com/resources/viruses/indepth/simile.xml.
13. F. Cohen, "Computational aspects of computer viruses," Computers & Security, vol. 8, no. 4, pp. 325-344, June 1989.
14. A. M. Turing, "On computable numbers, with an application to the Entscheidungs problem," in Proc. London Math. Soc., vol. 2, pp. 230-265, 1936, corrections in vol. 2, no. 43, pp. 544-546.
15. D. M. Chess and S. R. White, "An undetectable computer virus," in Virus Bulletin Conf, Sept. 2000, [Online]. Available: http://www.research.ibm.com/antivirus/SciPapers/VB2000DC.pdf, June 2002.
16. R. S. Boyer and J. S. Moore, "A fast string searching algorithm," Commun. ACM, vol. 20, no. 10, pp, 262-272, Oct. 1977.
17. S. A. Cook, "The complexity of theorem proving procedures," in Proc. 3rd ACM Symp. Theory of Computing, 1971, pp. 151-158.
18. C. Cowan, P. Wagle, C. Pu, S. Beattie, and J. Walpole, "Buffer overflows: Attacks and defenses for the vulnerability of the decade," in Proc. DARPA Information Survivability Conf. and Exposition. Hilton Head, SC, Jan. 2000, pp. 119-129.
19. M. W. Eichlin and J. A. Rochlis, "With microscope and tweezers: An analysis of the internet vires of November 1988," in Proc. IEEE Symp. Research in Security and Privacy, Oakland, CA, May 1989, pp. 326-345.