ABT-A — Authority Tokenization

Holding a credential is not holding authority. Three independently held components, bound to registry state, recorded on a tamper-evident chain.

Protocol overview  ·  Security Assurance  ·  Live · Security Assurance  ·  US Prov. 64/056,353
ABT-A
Authority
Client, SARA and the registry operator. Authority is recognized only when all three are present.
Live · Security Assurance
The problem

What ABT-A does

An attacker takes a server. On it they find a token, a key, a session — whatever the system treats as proof of authority. In most architectures that is the end of the story, because the system was built so that whoever holds the credential is the authority.

ABT-A separates the two. Authority is not a thing you hold. It is a relationship between three components held independently of one another: the client, SARA, and the ABT registry operator. Each is custodied separately. No one of them, and no two of them together, can produce recognized authority alone.

So the server that was taken does not carry the authority to act on itself. Taking it yields a credential; it does not yield recognition.

How it works

Three components, held apart

01
Client
The per-transaction key role of the existing ABT envelope, custodied and expiring. Without it the capability projection cannot be opened. It is never returned to a browser and never stored by the platform for the client to keep.
02
SARA
A registered tier authority in the ABT registry, held in a control plane outside the protected environment. Where no registration exists, the tier is a placeholder with no ciphertext at all — the capability’s material is absent, not merely switched off.
03
Registry operator
The activation signature produced by the ABT registry signer, and the event hash binding it to the canonical payload. The signer holds its key separately and returns a signature, never the key. Client and SARA together cannot manufacture this.
The distinction

Possession is not authority

A registration the operator key did not sign is not a recognized authority. A release that does not verify against the registry’s current state fails closed. A release bound to a retired generation cannot authorise anything, and a release that has already been applied cannot be applied again.

Each of those is a refusal, and each refusal is written to the same hash-chained evidence log as the actions — because a refusal nobody recorded is indistinguishable from a check that never ran.

In practice

Where ABT-A applies

Security Assurance operates four plans against a protected infrastructure environment. Plan A defends it continuously and Plan B investigates and contains a confirmed incident — both within a scope the client agreed in advance, so that a real incident does not wait on a signature.

Plan C verifies whether the environment and a recovery point can be trusted, and Plan D treats the environment as untrusted and rebuilds it. Those two reach much further into the client’s infrastructure, so they are locked. The client releases them explicitly, per capability, for a bounded period, and the release is not reusable.

The protected environment does not hold the client’s component. That is the point of the arrangement: compromising the machine does not confer the authority required to rebuild or re-verify it.

Plan A · DefendPlan B · ContainPlan C · VerifyPlan D · RecoverInfrastructure recovery

Technical primitives

ABT-A introduces no new cryptographic primitive. It composes the ones ABT already uses. Tier authorities are registered through the existing ABT registry, and each activation is signed by the registry operator key held by a separate signing service that returns a signature and never the key; the activation payload is canonicalised with sorted keys and the resulting event hash is SHA-256 over the payload concatenated with that signature. The client component is the per-transaction AES-256-GCM key role of the existing envelope construction, custodied with an expiry rather than issued to the holder. Capability projections are authored per tier at envelope construction, so a tier with no active registration has no initialisation vector, no authentication tag and no ciphertext. Authority state is bound to a registry state hash computed over the registry’s canonical authority listing; a release verifies that hash at the moment it is requested and again when it is applied, and fails closed if the registry has moved between the two. Releases are capability-specific, scope-specific, environment-specific, generation-specific, time-bounded and single-use. Regeneration revokes the prior generation, revokes every release issued under it, and retires the prior registrations through the registry’s partial unique index on active tier authorities. Every issuance, release, refusal and revocation is appended to the existing hash-chained evidence log, where each entry’s hash includes the prior entry’s hash.

Who this is for

Security architects designing authority models where credential theft, replay, forgery and insider misuse are assumed rather than excluded, and where compromise of the protected asset must not confer authority over it.

Incident response and recovery teams who need extraordinary capability during an incident without holding standing extraordinary capability before one.

Cryptography researchers studying multi-party authority composition, registry-bound recognition, canonical activation signing, and tamper-evident authorization records.

Auditors and counsel examining whether an authorized action can be shown to have been authorized — and whether a refusal can be shown to have occurred.

Policy researchers examining architectural constraints on privileged access, separation of duties enforced cryptographically rather than procedurally, and evidence standards for automated infrastructure action.

See it in Security Assurance → Protocol overview ABT-C specification