Using hierarchal change mining to manage network security policy evolution

  • Authors:
  • Gabriel A. Weaver;Nick Foti;Sergey Bratus;Dan Rockmore;Sean W. Smith

  • Affiliations:
  • Deparment of Computer Science, Dartmouth College, Hanover, New Hampshire;Deparment of Computer Science, Dartmouth College, Hanover, New Hampshire;Deparment of Computer Science, Dartmouth College, Hanover, New Hampshire;Deparment of Computer Science, Dartmouth College, Hanover, New Hampshire;Deparment of Computer Science, Dartmouth College, Hanover, New Hampshire

  • Venue:
  • Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Managing the security of complex cloud and networked computing environments requires crafting security policy--ranging from natural-language text to highly-structured configuration rules, sometimes multi-layered--specifying correct system behavior in an adversarial environment. Since environments change and evolve, managing security requires managing evolution of policies, which adds another layer, the change log. However, evolution increases complexity, and the more complex a policy, the harder it is to manage and update, and the more prone it is to be incorrect. This paper proposes hierarchical change mining, drawing upon the tools of software engineering and data mining, to help practitioners introduce fewer errors when they update policy. We discuss our approach and initial findings based on two longitudinal real-world datasets: low-level router configurations from Dartmouth College and high-level Public Key Infrastructure (PKI) certificate policies from the International Grid Trust Federation (IGTF).