z-logo
open-access-imgOpen Access
Evolving Bipartite Authentication Graph Partitions
Author(s) -
Aaron Scott Pope,
Daniel R. Tauritz,
Alexander D. Kent
Publication year - 2017
Publication title -
ieee transactions on dependable and secure computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.274
H-Index - 79
eISSN - 1941-0018
pISSN - 1545-5971
DOI - 10.1109/tdsc.2017.2652469
Subject(s) - computer science , bipartite graph , computer network , access control , distributed computing , vulnerability (computing) , authentication (law) , enhanced data rates for gsm evolution , graph partition , graph , theoretical computer science , computer security , artificial intelligence
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 resour...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom