EDBT 2026 Demo / reviewers in the wild / expert
Alexander D. Kent
dblp:48/10920
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-8779-2722ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Network security · 67% Authentication and access control · 33% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control
access control |
0.4 | 1 | 2019 | Evolving Bipartite Authentication Graph Partitions · IEEE Trans. Dependable Secur. Comput. 2019 |
Network security
enterprise network security |
0.4 | 1 | 2019 | Evolving Bipartite Authentication Graph Partitions · IEEE Trans. Dependable Secur. Comput. 2019 |
Network security
network partitioning |
0.4 | 1 | 2019 | Evolving Bipartite Authentication Graph Partitions · IEEE Trans. Dependable Secur. Comput. 2019 |
Graph algorithms and graph theory
graph partitioning |
0.1 | 1 | 2019 | Evolving Bipartite Authentication Graph Partitions · IEEE Trans. Dependable Secur. Comput. 2019 |
Methods — techniques the papers use, named apart from their topics
multi-objective evolutionary algorithm · 0.8bipartite graph modeling · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Evolving Bipartite Authentication Graph PartitionsabstractAs 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 demonstrates the effectiveness of the introduced method compared to previous naive methods. Aaron S. Pope, Daniel R. Tauritz, Alexander D. Kent |
IEEE Trans. Dependable Secur. Comput. | 3 |
| 2015 | Authentication graphs: Analyzing user behavior within an enterprise network
Alexander D. Kent, Lorie M. Liebrock, Joshua Neil |
Comput. Secur. | 1 |