skip to main content
10.1145/1363686.1364018acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

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

Authors Info & Claims
Published:16 March 2008Publication History

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.

References

  1. Aladdin eSafe CSRT 2005 Malicious Code Report: The big Threats Shift, 2006.Google ScholarGoogle Scholar
  2. L. A. Gordon, M. P. Leob, W. Lucyshyn, and R. Richardson. CSI/FBI Computer Crime and Security Survey, 2006.Google ScholarGoogle Scholar
  3. A. Moshchuk, T. Bragin, S. D. Gribble, and H. M. Levy. A Crawler-based Study of Spyware on the Web. In 13th Annual Network and Distributed System Security Symposium, San Diego, 2006. The Internet Society.Google ScholarGoogle Scholar
  4. C. Seifert, R. Steenson, T. Holz, Y. Bing, and M. A. Davis. Know your enemy: Malicious web servers, 2007.Google ScholarGoogle Scholar
  5. C. Seifert, I. Welch, and P. Komisarczuk. HoneyC - The Low-Interaction Client Honeypot. In NZCSRCS, Hamilton, 2007.Google ScholarGoogle Scholar
  6. R. Steenson and C. Seifert. Capture - Honeypot Client, 2006. Available from http://www.nz-honeynet.org/capture.html; accessed on 22 February 2007.Google ScholarGoogle Scholar
  7. K. Wang. HoneyClient, 2005. Available from http://www.honeyclient.org/trac; accessed on 2 Janurary 2007.Google ScholarGoogle Scholar
  8. Y.-M. Wang. Personal Communication, 2006.Google ScholarGoogle Scholar
  9. Y.-M. Wang, D. Beck, X. Jiang, R. Roussev, C. Verbowski, S. Chen, and S. King. Automated Web Patrol with Strider HoneyMonkeys: Finding Web Sites That Exploit Browser Vulnerabilities. In 13th Annual Network and Distributed System Security Symposium, San Diego, 2006. Internet Society.Google ScholarGoogle Scholar
  10. C. Willems, T. Holz, and F. Freiling. Toward Automated Dynamic Malware Analysis Using CWSandbox. IEEE Security and Privacy, 5(2):32--39, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Yu, F. Gua, S. Nanda, L.-c. Lam, and T.-c. Chiueh. A Feather-weight Virtual Machine for Windows Applications. In Second International Conference on Virtual Execution Environments, pages 24--34, Ottawa, 2006. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Yuan. Client-side honeypots. Master's thesis, University of Mannheim, 2007.Google ScholarGoogle Scholar

Index Terms

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

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
            March 2008
            2586 pages
            ISBN:9781595937537
            DOI:10.1145/1363686

            Copyright © 2008 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 16 March 2008

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate1,650of6,669submissions,25%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader