Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Import/export in digital rights management
Proceedings of the 4th ACM workshop on Digital rights management
Modeling and implementation of digital rights
Journal of Systems and Software
Fast Algorithms for Frequent Itemset Mining Using FP-Trees
IEEE Transactions on Knowledge and Data Engineering
Multi-level Frequent Pattern Mining
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Efficient license validation in MPML DRM architecture
Proceedings of the nineth ACM workshop on Digital rights management
A geometric approach for efficient licenses validation in DRM
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
Aggregate licenses validation for digital rights violation detection
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
| Hi-index | 0.00 |
DRM systems involve multiple parties such as owner, distributors and consumers. The owner issues redistribution licenses to its distributors. Distributors in turn using their received redistribution licenses can issue new redistribution licenses to other distributors and usage licenses to consumers. For rights violation detection, all newly generated licenses must be validated against the redistribution license used to generate them. The validation becomes complex when there exist multiple redistribution licenses for a media. In such cases, it requires evaluation of an exponential number of validation equations with up to an exponential number of summation terms. To overcome this, we propose a prefix tree based method to do the validation efficiently. Experimental results show that our proposed method can reduce the validation time significantly.