2006/01/19 by Riccardo Pucella, Pucella, Riccardo, Vicky Weissman +1 · 1 citation
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #H.2.7 #K.4.4 #Logic in Computer Science (cs.LO) #cs.CR #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0601085
30 pgs, preliminary version presented at WITS-04 (Workshop on Issues in the Theory of Security), 2004
arxiv created 2006/01/19 · arxiv updated 2009/12/01
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.