Please use this identifier to cite or link to this item:
|Title:||A geometric approach for efficient licenses validation in DRM||Authors:||Sachan, A.
|Issue Date:||2010||Citation:||Sachan, A.,Emmanuel, S.,Kankanhalli, M.S. (2010). A geometric approach for efficient licenses validation in DRM. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6358 LNCS : 132-149. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-15546-8_10||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. © 2010 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/40168||ISBN:||3642155456||ISSN:||03029743||DOI:||10.1007/978-3-642-15546-8_10|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.