Secure Formal Raising: Protecting the Development of AI through Executable Properties
Organizations: University of Bremen and DFKI Bremen, Germany
Abstract
Model raising revisits Turing's developmental view of machine intelligence. Formal Raising (FR) has recently been proposed to complement this view with explicit behavioral properties. This paper extends that proposal to the security of the raising environment. Secure Formal Raising (SFR) models policy integrity, authorization, and confidential data flow using four-valued evidence that preserves unknown and inconsistent assessments. We prove six security invariants and show that they force admission to accept only confirmed evidence. A plain-C reference implementation satisfies the invariants in a bounded exhaustive exploration, which also exposes a confused-deputy gap for tool calls that a provenance requirement closes.
Figures & tables
| Property | Active | Requirement |
|---|---|---|
| Identity | U, P | Identity evidence is . |
| Role | U, P | Teacher for U; teacher or student for P. |
| Integrity | U | Source evidence structural check is . |
| Flow | P | Eq. ( 7 ) yields . |
| Permit | P | A live permit matches. |
| Freshness | all | Expected version equals . |
| Operation | Cases | Admitted | Blocked |
|---|---|---|---|
| Observation | 384 | 384 | 0 |
| Policy update | 384 | 8 | 376 |
| Tool call | 384 | 24 | 360 |
| Data export | 384 | 24 | 360 |
| Total | 1,536 | 440 | 1,096 |
AI Assurance
Artificial intelligence assurance develops evidence and controls to evaluate, govern, and certify AI systems across their lifecycle and deployment contexts.
See all 85 papers