Graph-Based Detection of Policy Conflicts in Zero-Trust Multi-Cloud Environments

A zero-trust deployment spanning multiple clouds may contain independently maintained authorization rules that express incompatible decisions for overlapping requests. This paper presents a compact, graph-indexed approach for detecting such cross-control-plane inconsistencies. Policies are normalized into finite sets of principals, actions, resource groups, network zones, and assurance levels, together with a cloud identifier and an allow/deny effect. An incidence graph connects policies with their canonical tokens. Candidate pairs are obtained by intersecting opposite-effect identity and resource postings, after which the remaining policy dimensions are checked exactly. The procedure reports the same conflict edges as exhaustive pairwise evaluation under the stated model. We implemented both algorithms in Python and evaluated 500–4,000 synthetically generated policies for three abstract cloud providers, using five seeds per size. In all 20 trials, the conflict sets matched. At 4,000 policies, median execution time decreased from 922.14 ms to 140.58 ms, a 6.81× median trial-level speedup, while the indexed method removed 98.43% of eligible pairs from exact verification. The results demonstrate practical candidate reduction for a transparent, bounded cross-cloud policy model.

Authors

Institutions

Publication Details

Journal
Academic Journal of Applied Sciences
Published
2026-11-17
DOI
https://doi.org/10.54097/6nkh8a43
Primary Topic
Access Control and Trust
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Graph-Based Detection of Policy Conflicts in Zero-Trust Multi-Cloud Environments

Noor Bakker, Bas van der Meer
Academic Journal of Applied Sciences
Access Control and Trust
article

Graph-Based Detection of Policy Conflicts in Zero-Trust Multi-Cloud Environments

Noor Bakker, Bas van der Meer
article en

Abstract

A zero-trust deployment spanning multiple clouds may contain independently maintained authorization rules that express incompatible decisions for overlapping requests. This paper presents a compact, graph-indexed approach for detecting such cross-control-plane inconsistencies. Policies are normalized into finite sets of principals, actions, resource groups, network zones, and assurance levels, together with a cloud identifier and an allow/deny effect. An incidence graph connects policies with their canonical tokens. Candidate pairs are obtained by intersecting opposite-effect identity and resource postings, after which the remaining policy dimensions are checked exactly. The procedure reports the same conflict edges as exhaustive pairwise evaluation under the stated model. We implemented both algorithms in Python and evaluated 500–4,000 synthetically generated policies for three abstract cloud providers, using five seeds per size. In all 20 trials, the conflict sets matched. At 4,000 policies, median execution time decreased from 922.14 ms to 140.58 ms, a 6.81× median trial-level speedup, while the indexed method removed 98.43% of eligible pairs from exact verification. The results demonstrate practical candidate reduction for a transparent, bounded cross-cloud policy model.

Academic Journal of Applied SciencesVol. 3(3)
Wageningen University & Research (NL), Erasmus University Rotterdam (NL)
Access Control and Trust
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon