A Formal Foundation for ODRL
Riccardo Pucella, Vicky Weissman
TL;DR
This paper introduces a formal semantics for a fragment of ODRL, enabling precise interpretation of permissions and identifying the computational complexity, while proposing a tractable, expressive subset.
Contribution
It provides the first formal semantics for ODRL, analyzes the complexity of permission inference, and defines a practical, expressive fragment of the language.
Findings
Permission inference is NP-hard.
A decidable formal semantics is established.
A tractable, expressive fragment of ODRL is proposed.
Abstract
ODRL is a popular XML-based language for stating the conditions under which resources can be accessed legitimately. The language is described in English and, as a result, agreements written in ODRL are open to interpretation. To address this problem, we propose a formal semantics for a representative fragment of the language. We use this semantics to determine precisely when a permission is implied by a set of ODRL statements and show that answering such questions is a decidable NP-hard problem. Finally, we define a tractable fragment of ODRL that is also fairly expressive.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAccess Control and Trust · Digital Rights Management and Security · Security and Verification in Computing