The 1st Workshop on Model-Based Verification & Validation: Directed Acyclic Graph Modeling of Security Policies for Firewall Testing
Loading...
Files
Date
Authors
Journal Title
Journal ISSN
Volume Title
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Currently network security of institutions highly depend on firewalls, which are used to separate untrusted network from trusted one by enforcing security policies. Security policies used in firewalls are ordered set of rules where each rule is represented as a predicate and an action. This paper proposes modeling of firewall rules via directed acyclic graphs (DAG), from which test cases can be automatically generated for firewall testing. The approach proposed follows test case generation algorithm developed for event sequence graphs. Under a local area network setup with the aid of a specifically developed software for this purpose, generated test cases are converted to network test packets, test packets are sent to the firewall under test (FUT), and sent packets are compared with passed packets to determine test result.
Description
3rd IEEE International Conference on Secure Software Integration Reliability Improvement, SSIRI 2009; Shanghai; China; 8 July 2009 through 10 July 2009
Keywords
Network security, Directed acyclic graphs, Event Sequence graphs, Firewall policies, Security testing
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Tuğlular, T., Kaya, Ö., Müftüoğlu, C. A., and Belli, F. (2009, July 8-10). The 1st workshop on model-based verification & validation: Directed acyclic graph modeling of security policies for firewall testing. Paper presented at the 3rd IEEE International Conference on Secure Software Integration Reliability Improvement, SSIRI 2009. doi:10.1109/SSIRI.2009.52
WoS Q
Scopus Q

OpenCitations Citation Count
7
Volume
Issue
Start Page
393
End Page
398
PlumX Metrics
Citations
CrossRef : 3
Scopus : 6
Captures
Mendeley Readers : 25
Google Scholar™


