Prove the Deny: Runtime Authorization Assurance for Agentic Tooling in Regulated Environments

Recent protocol work on agentic tooling has improved authorization plumbing but leaves runtime authorization semantics, evidence and assurance largely to implementers. This paper argues the resulting gap is neither new nor protocol specific. It distils five demands from the logic that regulated obligation sets apply to any critical control: prove the control denied, produce evidence at the moment of the decision, enforce on every invocation, keep the audit record attached to the decision, and recertify on a cycle. The paper names a method, Prove the Deny, built on those five demands, gives a testable acceptance criterion for each, and maps the method to five obligation sets: the EU AI Act, DORA, NIS2, ISO/IEC 42001 and GxP. Using a four-point fit scale, the mapping shows that every control family the method requires is a direct obligation in at least one regime, and that not one of those obligations is written at the granularity of a per-invocation authorization decision for an agentic tool. The gap is therefore one of translation, not regulatory absence, and it is the reason the problem calls for an assurance method rather than a better protocol primitive.Version 0.9 is an open review release published for expert comment ahead of v1.0. Feedback is particularly welcomed on the crosswalk assessments in Section 5, the central finding, and the audit acceptance criteria in Section 4.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-18
DOI
https://doi.org/10.5281/zenodo.21430897
Primary Topic
Safety Systems Engineering in Autonomy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prove the Deny: Runtime Authorization Assurance for Agentic Tooling in Regulated Environments

Wayne Kearns
Zenodo (CERN European Organization for Nuclear Research)
Safety Systems Engineering in Autonomy
article

Prove the Deny: Runtime Authorization Assurance for Agentic Tooling in Regulated Environments

Wayne Kearns
article en

Abstract

Recent protocol work on agentic tooling has improved authorization plumbing but leaves runtime authorization semantics, evidence and assurance largely to implementers. This paper argues the resulting gap is neither new nor protocol specific. It distils five demands from the logic that regulated obligation sets apply to any critical control: prove the control denied, produce evidence at the moment of the decision, enforce on every invocation, keep the audit record attached to the decision, and recertify on a cycle. The paper names a method, Prove the Deny, built on those five demands, gives a testable acceptance criterion for each, and maps the method to five obligation sets: the EU AI Act, DORA, NIS2, ISO/IEC 42001 and GxP. Using a four-point fit scale, the mapping shows that every control family the method requires is a direct obligation in at least one regime, and that not one of those obligations is written at the granularity of a per-invocation authorization decision for an agentic tool. The gap is therefore one of translation, not regulatory absence, and it is the reason the problem calls for an assurance method rather than a better protocol primitive.Version 0.9 is an open review release published for expert comment ahead of v1.0. Feedback is particularly welcomed on the crosswalk assessments in Section 5, the central finding, and the audit acceptance criteria in Section 4.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 8%
Safety Systems Engineering in Autonomy
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.