Seifert, Christian, Komisarczuk, Peter and Welch, Ian (2008) Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots. In: 2008 ACM Symposium on Applied Computing (SAC '08), 16-20 Mar 2008, Fortaleza, 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)
ISBN:	9781595937537
Identifier:	10.1145/1363686.1364018
Page Range:	pp. 1426-1432
Identifier:	10.1145/1363686.1364018
Keywords:	Security, Client Honeypots, Intrusion Detection, Performance Improvement, Algorithms
Subjects:	Computing
Depositing User:	Vani Aul
Date Deposited:	21 Mar 2014 14:45
Last Modified:	28 Aug 2021 07:17
URI:	https://repository.uwl.ac.uk/id/eprint/801

Actions (login required)

View Item