arXiv · 2603.10094
Detecting Privilege Escalation with Temporal Braid Groups
Abstract
Within the Strongly Connected Components (SCCs) formed during the temporal evolution of a Cloud permission graph, we use the Burau Lyapunov exponent LE as an algebraic probe to locate the boundary between two risks regimes. We prove that no Abelian statistic (edge counts, net privilege flow, gate-firing rates) can determine LE. The non-commutation advantage is small, but actionable: we show how to leverage it to discriminate the two outstanding risk regimes, that we call dispersed and focused, for automating classification and governing remediation of risky Cloud permission flows.
Explore related subjects
Keep this discovery
Christophe Parisel. 2026-03-10. Detecting Privilege Escalation with Temporal Braid Groups. https://arxiv.org/abs/2603.10094
Cite the original work for its findings. Save a collection to share your selection of sources.