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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	Undefined/Unknown
Title of host publication	Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008
Pages	1426-1432
Number of pages	7
DOIs	https://doi.org/10.1145/1363686.1364018
Publication status	Published - 2008

Access to Document

@inproceedings{f49ca575eba141e8bd402b773ac616d3,

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

author = "Christian Seifert and Ian Welch and Peter Komisarczuk",

year = "2008",

doi = "10.1145/1363686.1364018",

language = "Undefined/Unknown",

pages = "1426--1432",

booktitle = "Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008",

}

Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots. / Seifert, Christian; Welch, Ian; Komisarczuk, Peter.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008. 2008. p. 1426-1432.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Seifert, Christian

AU - Welch, Ian

AU - Komisarczuk, Peter

PY - 2008

Y1 - 2008

U2 - 10.1145/1363686.1364018

DO - 10.1145/1363686.1364018

M3 - Conference contribution

SP - 1426

EP - 1432

BT - Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008

ER -