Abstract
Nowadays, a lot of techniques have been applied for the detection of malicious behavior. However, the current techniques taken into practice are facing with the challenge of much variations of the original malicious behavior, and it is impossible to respond the new forms of behavior appropriately and timely. With the questions above, we suggest a new method here to improve the current situation. Basically, we use conceptual graph to define malicious behavior, and then we are able to compare the similarity relations of the malicious behavior by testing the formalized values which generated by the predefined graphs in the code. In this paper, we show how to make a conceptual graph and propose an efficient method for similarity measure to discern the malicious behavior. As a result of our experiment, we can get more efficient detection rate. It can be used in detecting malicious codes in the script based programming environment of many kinds of embedded systems or telematics systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Dau.: Mathematical Foundations of Conceptual Graphs. In: 13th ICCS in Tutorial (2005)
Erdogan, O., Cao, P.: Hash-av: Fast virus signature scanning by cache-resident filters (2005), http://crypto.stanford.edu/~cao/hash-av/
Mishne, G., de Rijke, M.: Source Code Retrieval using Conceptual Similarity. RIAO, 539–554 (2004)
Christodorescu, J.: Static Analysis of Executables to Detect Malicious Patterns. In: 12th USENIX Security Symposium (2003)
Hensman, S.: Construction of Conceptual Graph Representation of Texts. HLT-NAACL, 49–54 (2004)
Karalopoulos, K. M., Kavouras, M.: Geographic Knowledge Representation Using Conceptual Graphs. In: 7th AGILE Conference on Geographic Information Science, Crete, Greece (2004)
Baget, J.-F.: Simple conceptual graphs revisited: Hypergraphs and conjunctive types for efficient projection algorithms. In: Proc. of ICCS (2003)
Zhong, J., Zhu, H., Li, J., Yu, Y.: Conceptual Graph Matching for Semantic Search. In: Proc. of ICCS (2002)
Zhang, L., Yu, Y.: Learning to generate cGs from domain specific sentences. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, p. 44. Springer, Heidelberg (2001)
Delugach, H.S.: CharGer A Graphical Conceptual Graph Editor. In: Proc. of ICCS (2001)
Dobrev, P., Strupchaska, A., Toutanova, K.: CGWorld-2001 - New Features and New Directions. In: Proc. of ICCS (2001)
Montes-y-Gómez, M., Gelbukh, A., López-López, A., Baeza-Yates, R.: Flexible Comparison of Conceptual Graphs. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 102–111. Springer, Heidelberg (2001)
Fernandez, F.: Heuristic Engines. In: 11th International Virus Bulletin Conference (2001)
Szappanos, G.: VBS Emulator Engine Design. In: Virus Bulletin Conference (2001)
Muttik, I.: Stripping down an AV Engines. In: Virus Bulletin Conference (2000)
Montes-y-Gómez, M., Gelbukh, A., López-López, A.: Comparison of Conceptual Graphs. In: Cairó, O., Cantú, F.J. (eds.) MICAI 2000. LNCS, vol. 1793. Springer, Heidelberg (2000)
Sowa, J.F.: Conceptual Graph Standard, American National Standard NCITS.T2/ISO/JTC1/SC32 WG2 N 0000 (April 2001), Access Online, http://www.bestweb.net/~sowa/cg/cgstand.htm
Sowa, J.F.: Conceptual Structures Information Processing in Mind and Machine, Ed. Addison-Wesley, Reading (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Choi, C., Choi, J., Kim, P., Kim, H. (2006). A Method for Efficient Malicious Code Detection Based on Conceptual Similarity. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_62
Download citation
DOI: https://doi.org/10.1007/11751632_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34077-5
Online ISBN: 978-3-540-34078-2
eBook Packages: Computer ScienceComputer Science (R0)