Digital Rights Management Implemented by RDF Graph Approach

Digital Rights Management Implemented by RDF Graph Approach

Jin Tan Yang (Southern Taiwan University of Technology, Taiwan) and Huai-Chien Horng (National Kaohsiung Normal University, Taiwan)
Copyright: © 2006 |Pages: 20
DOI: 10.4018/jdet.2006100104
OnDemand PDF Download:
No Current Special Offers


This paper proposes a design framework for constructing Digital Rights Management (DRM) that enables learning objects in legal usage. The central theme of this framework is that any design of a DRM must have theories as foundations to make the maintenance, extension or interoperability easy. While a learning objective consists of learning resources and its metadata, a DRM also needs metadata for describing itself as Rights Expression Language (REL). The proposed Resource Description Framework (RDF) graph design in this study is based on the Boolean operations of graph theory, whereas the RDF graph provides not only more coherent operations, but also opportunities for maintenance and interoperability at different platforms. Two algorithms for encoding and verifying rights in DRM are designed to deal with REL metadata in RDF format. This technological support also reduces the sophistication among role assignments, learning objects and task ontology of DRM. The DRM module is embedded to SCORM-compliant Content Repository Management System (CRMS) for IPR (Intellectual Property Rights) protection. Finally, some implications of this study are also included.

Complete Article List

Search this Journal:
Volume 20: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing