Evolving bipartite authentication graph partitions

Journal Article · Mon Jan 16 00:00:00 EST 2017 · IEEE Transactions on Dependable and Secure Computing

DOI:https://doi.org/10.1109/TDSC.2017.2652469· OSTI ID:1351186

Pope, Aaron Scott ^[1]; Tauritz, Daniel Remy ^[1]; Kent, Alexander D. ^[2]

---

1. Missouri Univ. of Science and Technology, Rolla, MO (United States)
2. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of large connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.

• Research Organization: Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE
• Grant/Contract Number: AC52-06NA25396
• OSTI ID: 1351186
• Report Number(s): LA-UR--15-27173
• Journal Information: IEEE Transactions on Dependable and Secure Computing, Journal Name: IEEE Transactions on Dependable and Secure Computing Journal Issue: 1 Vol. 16; ISSN 1545-5971
• Publisher: IEEE
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
network security