Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-12098-5_25
Title: Efficient aggregate licenses validation in DRM
Authors: Sachan, A.
Emmanuel, S.
Kankanhalli, M.S. 
Issue Date: 2010
Source: Sachan, A.,Emmanuel, S.,Kankanhalli, M.S. (2010). Efficient aggregate licenses validation in DRM. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5982 LNCS (PART 2) : 313-319. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-12098-5_25
Abstract: 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. © Springer-Verlag Berlin Heidelberg 2010.
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/40167
ISBN: 3642120970
ISSN: 03029743
DOI: 10.1007/978-3-642-12098-5_25
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Jan 17, 2018

Page view(s)

51
checked on Jan 22, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.