A geometric approach for efficient licenses validation in DRM

  • Authors:

  • Amit Sachan;Sabu Emmanuel;Mohan S. Kankanhalli

  • Affiliations:

  • School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computing, National University of Singapore, Singapore

  • Venue:
  • SDM'10 Proceedings of the 7th VLDB conference on Secure data management
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In DRM systems contents are distributed from the owner to consumers, often through multiple middle level distributors. The owner issues redistribution licenses to its distributors. The distributors using their received redistribution licenses can generate and issue new redistribution licenses to their sub-distributors and new usage licenses to consumers. For the rights violation detection, all the newly generated licenses must be validated. The validation process becomes complex when there exist multiple redistribution licenses for a content with the distributors. In such cases, it requires the validation using an exponential number of validation equations, which makes the validation process much computation-intensive. Thus to do the validation efficiently, in this paper we propose a method to geometrically derive the relationship between different validation equations to identify the redundant validation equations. These redundant validation equations are then removed using graph theory concepts. Experimental results show that the validation time can be significantly reduced using our proposed approach.