skip to main content
10.1145/2746194.2746199acmotherconferencesArticle/Chapter ViewAbstractPublication PageshotsosConference Proceedingsconference-collections
research-article

Preemptive intrusion detection: theoretical framework and real-world measurements

Published:21 April 2015Publication History

ABSTRACT

This paper presents a Factor Graph based framework called AttackTagger for highly accurate and preemptive detection of attacks, i.e., before the system misuse. We use security logs on real incidents that occurred over a six-year period at the National Center for Supercomputing Applications (NCSA) to evaluate AttackTagger. Our data consist of security incidents that led to compromise of the target system, i.e., the attacks in the incidents were only identified after the fact by security analysts. AttackTagger detected 74 percent of attacks, and the majority them were detected before the system misuse. Finally, AttackTagger uncovered six hidden attacks that were not detected by intrusion detection systems during the incidents or by security analysts in post-incident forensic analysis.

References

  1. Anderson, J. P. Computer security threat monitoring and surveillance. Tech. rep., 1980.Google ScholarGoogle Scholar
  2. Andres, B. e. a. An empirical comparison of inference algorithms for graphical models with higher order factors using opengm. In Pattern Recognition. Springer, 2010, pp. 353--362. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bro. Bro intrusion detection system. www.bro-ids.org.Google ScholarGoogle Scholar
  4. Cao, P., Chung, K.-w., Kalbarczyk, Z., Iyer, R., and Slagell, A. J. Preemptive intrusion detection. In Proceedings of the 2014 Symposium and Bootcamp on the Science of Security (2014), ACM, p. 21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Carter, C. K., and Kohn, R. On gibbs sampling for state space models. Biometrika 81, 3 (1994), 541--553.Google ScholarGoogle ScholarCross RefCross Ref
  6. Denning, D. E. An intrusion-detection model. IEEE Transactions on Software Engineering, 2 (1987), 222--232. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Fava, D. S. e. a. Projecting cyberattacks through variable-length markov models. Information Forensics and Security, IEEE Trans. on (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Frey, B. J., Kschischang, F. R., Loeliger, H.-A., and Wiberg, N. Factor graphs and algorithms. In Proceedings of the Annual Allerton Conference on Communication Control and Computing (1997), pp. 666--680.Google ScholarGoogle Scholar
  9. Hu, J., Yu, X., Qiu, D., and Chen, H.-H. A simple and efficient hidden markov model scheme for host-based anomaly intrusion detection. Network, IEEE 23, 1 (January 2009), 42--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lafferty, J., McCallum, A., and Pereira, F. C. Conditional random fields: Probabilistic models for segmenting and labeling sequence data.Google ScholarGoogle Scholar
  11. Lamport, L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21 (1978). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Nikovski, D. Constructing bayesian networks for medical diagnosis from incomplete and partially correct statistics. Knowledge and Data Engineering, IEEE Transactions on 12, 4 (2000), 509--516. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Pecchia, A., Sharma, A., Kalbarczyk, Z., Cotroneo, D., and Iyer, R. K. Identifying compromised users in shared computing infrastructures: a data-driven bayesian network approach. In Proc. of Reliable Distributed Systems (SRDS) (2011), IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Pedregosa, F. e. a. Scikit-learn: Machine learning in python. JMLR 12 (2011). Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Qin, X., and Lee, W. Attack plan recognition and prediction using causal networks. In Computer Security Applications Conference, 2004. 20th Annual (2004), IEEE, pp. 370--379. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Robert, C. P., and Casella, G. Monte Carlo Statistical Methods (Springer Texts in Statistics). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005. Google ScholarGoogle Scholar
  17. Sadoddin, R., and Ghorbani, A. Alert correlation survey: framework and techniques. In Proc. of Intl. Conference on Privacy, Security and Trust (2006), ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Sharma, A., Kalbarczyk, Z., Barlow, J., and Iyer, R. Analysis of security data from a large computing organization. In Dependable Systems & Networks (DSN) (2011), IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sheskin, D. J. Handbook of parametric and nonparametric statistical procedures. crc Press, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Shulman, A. The underground credentials market. Computer Fraud & Security 2010, 3 (2010), 5--8.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Preemptive intrusion detection: theoretical framework and real-world measurements

          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 Other conferences
            HotSoS '15: Proceedings of the 2015 Symposium and Bootcamp on the Science of Security
            April 2015
            170 pages
            ISBN:9781450333764
            DOI:10.1145/2746194
            • General Chair:
            • David Nicol

            Copyright © 2015 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: 21 April 2015

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            HotSoS '15 Paper Acceptance Rate13of22submissions,59%Overall Acceptance Rate34of60submissions,57%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader