Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bakker et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: