Skip to main content
Evolving Bipartite Authentication Graph Partitions
IEEE Transactions on Dependable and Secure Computing
  • Aaron S. Pope
  • Daniel R. Tauritz, Missouri University of Science and Technology
  • Alexander D. Kent

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. Results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.

Computer Science
Research Center/Lab(s)
Center for High Performance Computing Research
Second Research Center/Lab
Intelligent Systems Center

Article in Press

Document Type
Article - Journal
Document Version
File Type
© 2017 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
Publication Date
01 Jan 2019
Citation Information
Aaron S. Pope, Daniel R. Tauritz and Alexander D. Kent. "Evolving Bipartite Authentication Graph Partitions" IEEE Transactions on Dependable and Secure Computing Vol. 16 Iss. 1 (2019) p. 58 - 71 ISSN: 1545-5971
Available at: