skip to main content
research-article

Aggregate licenses validation for digital rights violation detection

Published:20 September 2012Publication History
Skip Abstract Section

Abstract

Digital Rights Management (DRM) is the term associated with the set of technologies to prevent illegal multimedia content distribution and consumption. DRM systems generally involve multiple parties such as owner, distributors, and consumers. The owner issues redistribution licenses to its distributors. The distributors in turn using their received redistribution licenses can generate and issue new redistribution licenses to other distributors and new usage licenses to consumers. As a part of rights violation detection, these newly generated licenses must be validated by a validation authority against the redistribution license used to generate them. The validation of these newly generated licenses becomes quite complex when there exist multiple redistribution licenses for a media with the distributors. In such cases, the validation process requires validation using an exponential number (to the number of redistribution licenses) of validation inequalities and each validation inequality may contain up to an exponential number of summation terms. This makes the validation process computationally intensive and necessitates to do the validation efficiently. To overcome this, we propose validation tree, a prefix-tree-based validation method to do the validation efficiently. Theoretical analysis and experimental results show that our proposed technique reduces the validation time significantly.

References

  1. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB). Vol. 1215. 487--499. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Alessi, A. 2007. Internet protocol television (IPTV). Ph.D. thesis.Google ScholarGoogle Scholar
  3. Arnab, A. and Hutchison, A. 2005. Fairer usage contracts for DRM. In Proceedings of the 5th ACM Workshop on Digital Rights Management. 1--7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., and Yiu, T. 2005. Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Engin. 1490--1504. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chiariglione, L. A walkthrough in the interoperable DRM platform v. 3.0 specification. Tech. rep. http://www.dmpf.org/documents/walkthrough_in_idp-3.htmGoogle ScholarGoogle Scholar
  6. Chuang, K. T., Huang, J. L., and Chen, M. S. 2008. Mining top-k frequent patterns in the presence of the memory constraint. VLDB J. 17, 5, 1321--1344. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chui, C. K., Kao, B., and Hung, E. 2007. Mining frequent itemsets from uncertain data. In Advances in Knowledge Discovery and Data Mining, Vol. 4426, Springer, 47--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Eavis, T. and Zheng, X. 2009. Multi-Level frequent pattern mining. In Proceedings of the Conference on Database Systems for Advanced Applications (DASFAA). 369--383. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Garcia, R. and Gil, R. 2010. Content value chains modelling using a copyright ontology. Inf. Syst. 35, 4, 483--495. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Han, J., Pei, J., Yin, Y., and Mao, R. 2004. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8, 1, 53--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hwang, S. O., Yoon, K. S., Jun, K. P., and Lee, K. H. 2004. Modeling and implementation of digital rights. J. Syst. Softw. 73, 3, 533--549. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Iannella, R. 2006. Digital rights management. In Handbook of Information Security, H. Bidgoli, Ed, Vol. 3, Wiley.Google ScholarGoogle Scholar
  13. Iannella, R. 2008. Rights management and licensing multimedia services. Intelligence (sci) 120, 327--349.Google ScholarGoogle Scholar
  14. Jamkhedkar, P. A. and Heileman, G. L. 2009. Digital rights management architectures. Comput. Electric. Engin. 35, 2, 376--394. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Knuth, D. E. 1998. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison Wesley Longman Publishing Co., Inc. Redwood City, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Li, H., Zhao, L., Wang, C., and Ma, F. 2010. DRM system for multiple cascaded business operators. In Proceedings of the International Conference on Multimedia and Expo (ICME).Google ScholarGoogle Scholar
  17. Liu, G., Lu, H., Lou, W., Xu, Y., and Yu, J. X. 2004. Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min. Knowl. Discov. 9, 3, 249--274.Google ScholarGoogle ScholarCross RefCross Ref
  18. Mahanta, V. S. 2010. Multi-level supply chain disruption and coordinated response. Ph.D. thesis, Drexel University.Google ScholarGoogle Scholar
  19. O'Driscoll, G. 2008. Next Generation IPTV Services and Technologies. Wiley-Interscience. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Rojas, C. and Nasraoui, O. 2007. Summarizing evolving data streams using dynamic prefix trees. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence. IEEE Computer Society Los Alamitos CA, 221--227. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sachan, A., Emmanuel, S., and Kankanhalli, M. 2010. Efficient aggregate licenses validation in DRM. In Proceedings of the Conference on Database Systems for Advanced Application(DASFAA'2010). Springer, 313--319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Sachan, A., Emmanuel, S., and Kankanhalli, M. S. 2009. Efficient license validation in MPML DRM architecture. In Proceedings of the 9th ACM Workshop on Digital Rights Management(DRM'09). 73--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Sans, T., Cuppens, F., and Cuppens-Boulahia, N. 2007. OPA: Onion policy administration model-Another approach to manage rights in DRM. Int. Fed. Inf. Process. 349--360.Google ScholarGoogle Scholar
  24. Van der Veen, J. and Venugopal, V. 2005. Using revenue sharing to create winwin in the video rental supply chain. J. Oper. Res. Soc. 56, 7, 757--762.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Aggregate licenses validation for digital rights violation detection

        Recommendations

        Reviews

        Brad D. Reid

        Digital rights management (DRM) has become increasingly difficult and is moving from enforcement to application models. The issue of trust in the distributor to follow the terms of the license and the fact that multiple forms of licenses cover the same content in a global context add to the difficulty of this task. The authors of this advanced paper propose an efficient mathematically based validation of digital rights licenses in the context of multilayered licenses. Individuals involved in DRM will find this presentation worthwhile. This carefully and logically written 21-page presentation focuses on mathematics and not on the public policy considerations of intellectual property. To understand the mathematical examples of the problem and the unique approach to a solution, the reader should have an intermediate level of proficiency in mathematics. Nevertheless the presentation is carefully constructed and complete. Part of this novel efficiency comes from a process in which the researchers collect "the logs of the sets of the redistribution licenses ... and aggregate constraint counts in issuing licenses." Additional efficiency derives from the introduction of a "validation tree, a prefixed-tree-based structure." The experimental analysis of this approach uses an Intel dual-core 2.40 GHz central processing unit (CPU) with 2 GB of random access memory (RAM) and programs written in Java. The authors believe their approach to the validation problem is unique, and they assert that the experimental results confirm efficiencies in validation time and memory requirements. Additional research is anticipated. Online Computing Reviews Service

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Multimedia Computing, Communications, and Applications
          ACM Transactions on Multimedia Computing, Communications, and Applications  Volume 8, Issue 2S
          Special Issue on Multimedia Security
          September 2012
          121 pages
          ISSN:1551-6857
          EISSN:1551-6865
          DOI:10.1145/2344436
          Issue’s Table of Contents

          Copyright © 2012 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 20 September 2012
          • Accepted: 1 March 2011
          • Revised: 1 January 2011
          • Received: 1 February 2010
          Published in tomm Volume 8, Issue 2S

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!