An efficient analysis of honeypot data based on Markov Chain

Journal of Applied Sciences

Volumn 10, Issue 3, 2010, Pages 196-202

  Kimou, K P ^a   Barry, B ^b   Babri, M ^a   Oumtanaga, S ^a   Kadjo, T L ^a  

^a INPHB   (Côte d’Ivoire)

^b UNIVERSITÉ CHEIKH ANTA DIOP   (Senegal)

Author keywords

Cyber criminal; Hacker; Honeynet; Intruder

Indexed keywords

CHAINS; MARKOV PROCESSES; PERSONAL COMPUTING;

BEHAVIORAL MODEL; CYBER CRIMINALS; EFFICIENT ANALYSIS; EXPERIMENTAL PLATFORM; HACKER; HONEYNET; INTRUDER; PREDICTIVE MODELING;

NETWORK SECURITY;

EID: 74349083768     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2010.196.202     Document Type: Article

References (17)

1. Alata, E., M. Dacier, Y. Deswarte, M. Kaaniche and K. Kortchinsky et al., 2005. Leurré.com: Retour d'expérience sur plusieurs mois d'utilisation d'un pot de miel distribué mondialement. Proceedings of the Symposium Sur La Sécurité des Technologies de l'Information et des Communications, June 1-3, Rennes, France.
2. Alata, E., M. Dacier, Y. Deswarte, M. Kaaniche and K. Kortchinsky et al., 2006. Collection and analysis of attack dated based on honeypots deployed on the Internet. Advances in Information Security, Springer US. Quality of Protection, pp: 79-91.
3. Bremaud, P., 2001. Markov Chains: Gibbs field, Monte Carlo Simulations and Queues. 2nd Edn., Springer, NewYork, ISBN: 978-0387985091.
4. Callegari, C., S. Vaton and M. Pagano, 2008. A new statistical approach to network anomaly detection. Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems, Jun. 16-18, Edinburgh, UK, pp: 441-447.
5. Graham, C., 2008. Chaînes de Markov: Cours. 1st Edn., Dunod, Britain, ISBN-13: 978-2100520831, pp: 274.
6. Haixiao, C., S. Kulkarni and S. Verdu, 2006. An algorithm for universal lossless compression with side information. IEEE Trans. Inform. Theory, 52: 4008-4016.
7. Jha, S., K. Tan and R.A. Maxion, 2001. Markov chains, classifiers and intrusion detection. Proceedings of 14th IEEE Computer Security Foundations Workshop, (CSFW'01), IEEE Computer Society, pp:206-219.
8. Ju, W.H. and Y. Vardi, 2001. A hybrid high-order markov chain model for computer intrusion detection. J. Comput. Graph. Statistics, 10: 277-295.
9. Kaaniche, M., Y. Deswarte, E. Alata, M. Dacier and V. Nicomette, 2006. Empirical analysis and statistical modeling of attack processes based on honeypots. Proceedings of the WEEDS 2006-Workshop on Empirical Evaluation of Dependability and Security, June 25-28, Philadelphia, USA., pp: 1-6.
10. Kaber, S.M., 2002. Introduction à scilab-exercices pratiques corriges d'algebre linéaire. Ellipses Marketing, pp: 226.
11. Lockhart, A., 2004. Network Intrusion Detection Network Security Hack. 2nd Edn., O'Reilly Media Inc., USA., pp: 348-412.
12. Nong, Y., 2000. A markov chain model of temporal behavior for anomaly detection. Proceedings of the IEEE Workshop on Information Assurance and Security United States Military Academy, June 6-7, West Point, New York, pp: 171-174.
13. Nuel, G. and B. Prum, 2007. Analyse statistique des séquences biologiques: Modélisation markovienne, alignements et motifs (Collection bioinformatique). http://www.lavoisier.fr/notice/fr418634.html.
14. Oudot, B.L. and V. Glaume, 2003. Global intrusion detection: Prelude hydrid IDS. Technical Report.
15. Oumtanaga, S., K.P. Kimou and G.K. Kouadio, 2006. Specification of has model of honeypot attack based on raised data. Proc. World Acad. Sci. Eng. Technol., 17: 207-211.
16. Shannon, C.E., 1948. A mathematical theory of communication. Bell Syst. Tech. J., 27: 379-423.
17. Spitzner, L., 2002. Honeypots: Tracking Hackers. Addison Wesley, USA., pp: 480.