Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots

Seifert, C., Komisarczuk, Peter and Welch, I. (2008) Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots. In: 23rd Annual ACM Symposium on Applied Computing, 16-20 March 2008, Fortaleza, Ceara, Brazil.

Full text not available from this repository.

Abstract

We present the design and analysis of a new algorithm for
high interaction client honeypots for finding malicious servers
on a network. The algorithm uses the divide-and-conquer
paradigm and results in a considerable performance gain
over the existing sequential algorithm. The performance
gain not only allows the client honeypot to inspect more
servers with a given set of identical resources, but it also
allows researchers to increase the classification delay to investigate
false negatives incurred by the use of artificial time
delays in current solutions.

Item Type: Conference or Workshop Item (Paper)
Subjects: Computing
Depositing User: Vani Aul
Date Deposited: 21 Mar 2014 14:45
Last Modified: 11 Dec 2015 10:46
URI: http://repository.uwl.ac.uk/id/eprint/801

Actions (login required)

View Item View Item

Menu