Beyond Proof of Possession: A Relational Theory of Authority
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.
Nadia: I'm Nadia.
Elias: And I'm Elias, here with Priya.
Nadia: We're looking at the paper: "Beyond Proof of Possession: A Relational Theory of Authority".
Elias: Here's the gist of the paper. The paper, "Beyond Proof of Possession: A Relational Theory of Authority," explores a relational theory of authority within access control systems, moving beyond conventional notions such as simple possession or predefined roles to establish a framework where authority is fundamentally defined by relationships between entities.
Nadia: The central aim of this work is to provide a more flexible and expressive semantic model for authorization, enabling the representation of complex authorization scenarios that traditional models often struggle to capture effectively.
Elias: Key aspects discussed in the paper revolve around leveraging these inherent relationships as the primary mechanism for defining both permissions and constraints within an access control context, thereby offering a distinctly relational perspective on how access decisions are made.
Title and authors: Nadia: Let’s talk briefly about the title and who wrote this, "Beyond Proof of Possession: A Relational Theory of Authority." It sounds like it’s aiming to redefine how we think about access control systems fundamentally.
Elias: Nicola Gallo is the author here, and this paper is trying to establish a framework where authority isn't just a static thing tied to an object; it’s something dynamic that evolves based on relationships.
Nadia: It really challenges the traditional idea of possession being the sole driver for determining who can do what in a system.
Elias: Right, they are separating proof of possession from proof of relationship and authorization itself, which is a big semantic move for this whole area.
The paper's summary: Nadia: So, what the paper boils down to is that authorization needs to be tied to an occurrence’s causal history rather than just who holds the artifact at that moment.
Elias: They argue that possession doesn't tell you if a request is valid; you need to know if that request continues a valid chain of events, which is what proof of relationship addresses.
Nadia: It means the same key could be used differently depending on the history leading up to it, which makes sense when you think about complex workflows.
Elias: They make this distinction clear by saying two occurrences with the same artifact and profile might not have authorization equivalence if their origin contexts are different.
Priya: From a privacy and measurement standpoint, I'm interested in this history aspect. How does tracking a causal history affect the actual data we collect about access?
Nadia: That’s a fair question, Priya. The paper says that while the concept is relational, they still need mechanisms to establish facts about the executor initially before moving into these more complex historical evaluations.
The paper's improvements: Elias: Now for the actual technical improvements they propose, which is where things get really interesting for building actual systems. They suggest a few ways to enforce this relational view in practice.
Nadia: One key idea is distinguishing between what an actor actually possesses and what that possession permits them to exercise in its causal history.
Elias: They introduce the idea that possession might help establish holder binding, but authorization is about what that occurrence can do within its specific history, which they call a transition evaluated from proof of relationship and non-expansion of authority context.
Nadia: That means you can enforce constraints like saying authority can't expand along a valid causal history, which the paper states is represented by something like Ci plus one being contained within Ci.
Elias: And that leads to preventing the confused deputy problem because if you restrict any exercise beyond the origin under those conditions, then an exercise with that artifact in a different history simply can't be valid.
Priya: If we’re talking about enforcing non-expansion along a history, does this mean we have tighter bounds on how much an agent can use its credentials over time?
Conclusion: Nadia: So, to wrap up the paper "Beyond Proof of Possession: A Relational Theory of Authority," they’re essentially arguing that we need a model where authority is defined by these execution occurrences and their causal lineage, not just by static possession.
Elias: They show how this allows us to realize authorization without needing successor-side possession proof, using something called a boundary-witnessed checkpoint construction.
Nadia: That’s significant because it means we can check authorization based on the state at a specific point in time or context, rather than having to track every single step back through an infinite history.
Elias: The limitation they mention is that they still need a sound evidence mechanism to establish the initial profile of the executor before those relational checks can even begin.
Priya: It seems like this moves us toward systems where authorization is much more context-aware, which should help in building more robust security protocols for complex interactions.
Nicola Gallo
cs.CR, cs.DC
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 30 pages
Code: https://github.com/pic-protocol/pic-protocol.github.io
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 82/100
The gist: The paper, "Beyond Proof of Possession: A Relational Theory of Authority," explores a relational theory of authority within access control systems…
Key concepts
- Relational Theory of Authority
- Authority is defined not by what an actor holds (possession) but by the specific relationships linking entities. This framework treats access rights as emergent properties derived from how different actors are connected within a system, offering a flexible way to model permissions and constraints.
- Causal History
- This refers to the sequence of events or interactions that lead to a state. The theory distinguishes between what an actor possesses at one point and what they are actually permitted to exercise based on the entire causal history of their actions within the system.
- Non-expansion of Authority
- This principle ensures that authority and relational freedom do not increase or expand along a valid causal lineage. If you have a specific path of authorization, the authority granted at each subsequent step in that path cannot be greater than or equal to the previous step's authority.
- Confused Deputy Problem Prevention
- The system prevents unauthorized actions by ensuring that no exercise of authority occurs beyond its original origin within a valid lineage. This stops an entity from using its granted permissions through an intermediary who is not part of the authorized chain.
Terminology
Summary
The paper, The result does not claim that PoP is useless, nor that
deployed possession-based authorization systems do not
authorize. Rather, it separates two roles that are often collapsed: evidence that an actor controls something
and the semantic condition that makes a continuation
authorized.Beyond Proof of Possession: A Relational Theory of Authority,
explores a relational theory of authority within access control systems, moving beyond conventional notions such as simple possession or predefined roles to establish a framework where authority is fundamentally defined by relationships between entities. The central aim of this work is to provide a more flexible and expressive semantic model for authorization, enabling the representation of complex authorization scenarios that traditional models often struggle to capture effectively. p. 1Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved systems can distinguish between what an actor possesses and what is permitted to exercise it in a causal history, as
possession may help establish holder binding
whileauthorization answers what that occurrence may exercise here, in its causal history.
-
Systems can enforce non-expansion of authority and relational freedom along a valid lineage because
along one valid causal history, Ci+1 ⊆ Ci and ρi+1 ⇒ ρi.
-
The system can prevent the confused deputy problem by ensuring that
no in-lineage exercise beyond the origin
occurs under Assumptions 1 and 2, leading to the conclusion that(o, r) ∈/ C0(req) ⇒ (o, r) cannot be a valid in-lineage exercise.
-
The system can realize authorization without requiring successor-side possession by employing a boundary-witnessed checkpoint construction that satisfies the premises
without requiring any successor executor to prove possession of an artifact.
Abstract
Proof-of-Possession (PoP) establishes that an executor controls an artifact (key, token, credential, or capability), but such control alone determines neither the executor's relational profile nor the causal history of an execution occurrence. We separate PoP from Proof of Relationship (PoR), the semantic property that one execution occurrence validly continues another, and from authorization, which is occurrence-sensitive. The foundational change is in the semantic domain of authorization: from holders and authority-bearing artifacts to execution occurrences situated in causal histories. We give authorization models an observation-based occurrence verdict and a separate transition-admissibility relation; kernel inclusion yields a partial order on observation-kernel classes. Building on Provenance Identity Continuity (PIC) and Proof-of-Continuity (PoC), we classify executors by authorization-relevant equivalence relations whose quotients form relational profile spaces, with positive predicates over profile transitions forming a distributive lattice. This adds relational attenuation to authority attenuation: along a valid causal history, C i+1 C i and ρ i+1 soρ i. We prove dual monotonicity, combined closure, and origin relational closure. Two occurrences of the same authenticated executor, with the same profile and possession evidence, need not be authorization-equivalent, and within a valid PIC lineage a deputy's independent authority cannot be imported outside the origin context. Finally, we prove that the executor-dependent decision factors through the relational profile and is invariant under sound mechanisms establishing it: successor-side PoP is a possible evidence mechanism, not a necessary premise of authorization. Under explicit Witness Assumptions, a boundary-witnessed checkpoint construction realizes the premises without successor-side PoP.
Sources
- Proof-of-Continuity: A Temporal Model for Authority Propagation in Distributed Systems and AI Agents
Related papers
- From Strategy Search to Policy Learning: MCTS-Guided Adversarial Co-Evolution for LLM Safety Alignment
- Privacy Leakage from Recurrent State in LLM Inference
- Incrementally Verifiable Oracle Aided Computation
- Privilege and confidentiality in generative AI workflows
- BadMoE: Backdooring Mixture-of-Experts LLMs via Routing-Aware Triggers and Task-Underutilized Experts
- CoVault: Secure, Scalable Analytics of Personal Data