A logic for reasoning about digital rights

@article{Pucella2002ALF,
  title={A logic for reasoning about digital rights},
  author={Riccardo Pucella and Vicky Weissman},
  journal={Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15},
  year={2002},
  pages={282-294}
}
We present a logic for reasoning about licenses, which are "terms of use" for digital resources. The logic provides a language for writing both properties of licenses and specifications that govern a client's actions. We discuss the complexity of checking properties and specifications written in our logic and propose a technique for verification. A key feature of our approach is that it is essentially parameterized by the language in which the licenses are written, provided that this language… Expand

Topics from this paper

ay 2 00 4 A Logic for Reasoning about Digital Rights ∗
We present a logic for reasoning about licenses, which are “t erms of use” for digital resources. The logic provides a language for writing both prop e ties of licenses and specifications that governExpand
A Logic Update Language with Active Rules for Reasoning about Digital Rights
We propose LucScript as a new logic based language for expressing digital rights, which bases on a logic update language with active rules so that the rights model can show an active adapting abilityExpand
Formal digital license language with OTS/CafeOBJ method
TLDR
The proposed formal license language can be used not only for the formal specifications of licenses which capture both static observations and dynamic state transitions of the licenses, but also for the formally verification of licenses thanks to the executability and theorem proving facility of CafeOBJ. Expand
On the operational semantics of rights expression languages
TLDR
This work proposes an operational model for formalising and enforcing rights expression languages based on the concept of a rights expression compiler and demonstrates the power and practicality of this model by using it to develop operational semantics for the OMA Rights Expression Language. Expand
Algebraic Specifications for OMA REL Licenses
TLDR
This work claims that the Rights Expression Language (OMA-REL) does not rely on formal semantics, and proposes an abstract syntax for OMA-REL and writes an algebraic specification of it using CafeOBJ, an executablegebraic specification language, with the future goal the creation of automated tools that check the behavior of a set of licenses under a certain environment. Expand
LicenseScript: a novel digital rights language and its semantics
TLDR
This work proposes LicenseScript as a new multiset rewriting/logic based language for expressing dynamic conditions of use of digital assets such as music, video or private data and provides the language with a simple semantics based on traces. Expand
One License to Compose Them All - A Deontic Logic Approach to Data Licensing on the Web of Data
TLDR
This paper proposes and evaluates a deontic logic semantics which allows us to define theDeontic components of the licenses, i.e., permissions, obligations, and prohibitions, and generate a composite license compliant with the licensing items of the composed different licenses. Expand
Heuristics for Licenses Composition
TLDR
Two composition heuristics are analyzed, showing how they can be used to combine the deontic components specified by the licenses, i.e., permissions, obligations, and prohibitions, and which are the most suitable combinations depending on the starting licenses. Expand
A Logic for Auditing Accountability in Decentralized Systems
TLDR
This work designs a logic that allows audited agents to prove their actions, and to proof their authorization to posses particular data, in a language that allows agents to distribute data with usage policies in a decentralized architecture. Expand
FORMAL SPECIFICATIONS OF LICENSES AND DIGITAL RIGHTS MANAGEMENT SYSTEMS WITH OTS / CAFEOBJ METHOD ( EXTENDED ABSTRACT )
We describe how to formally specify licenses as well as digital rights managements systems (DRMSs) with OTS/CafeOBJ. In practice, several rights expression languages (RELs) have been developed in theExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
Deontic logic: a concise overview
TLDR
A short (and incomplete) historic overview of the branch of modal logic that is concerned with (reasoning about) norms and normative behaviour, viz. deontic logic. Expand
Applications of deontic logic in computer science: a concise overview
TLDR
This paper surveys a number of applications of deontic logic in computer science that have arisen in the eighties, and gives a systematic framework in which these applications can be classified. Expand
A logical reconstruction of SPKI
TLDR
This work shows how a Logic of Local Name Containment that has a clear semantics and was shown to completely characterize SDSI name resolution can be extended to deal with a number of key features of SPKI, including revocation, expiry dates, and tuple reduction, without invoking nonmonotonicity. Expand
The complexity of propositional linear temporal logics
We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems areExpand
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
TLDR
The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of truth and validity checking and yield clean and essentially optimal algorithms for both problems. Expand
Alternating Automata: Checking Truth and Validity for Temporal Logics
We describe an automata-theoretic approach to the automated checking of truth and validity for temporal logics. The basic idea underlying this approach is that for any formula we can construct anExpand
A logic model for electronic contracting
TLDR
A logic model is presented that emphasizes temporal, deontic and performative aspects of contracting, which aims to improve contracting processes by streamlining red tape enforcing legal correctness. Expand
Athena: A Novel Approach to Efficient Automatic Security Protocol Analysis
TLDR
A new efficient automatic verification technique, Athena, is proposed, which uses a new efficient representation - the Strand Space Model extension - and utilizes techniques from both model checking and theorem proving approaches to prove the correctness of many security protocols with arbitrary number of concurrent runs. Expand
Formal languages and their relation to automata
  • J. Hopcroft, J. Ullman
  • Computer Science
  • Addison-Wesley series in computer science and information processing
  • 1969
TLDR
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory. Expand
Models and languages for digital rights
TLDR
This paper proposes a language and a model that is capable of expressing a range of licenses of the kind that DRM systems may be expected to support, and aims to facilitate new kinds of agreements between the parties involved in trading intangible goods. Expand
...
1
2
3
4
5
...