Show simple item record

dc.contributor.authorAk, M.en_US
dc.contributor.authorKaya, K.en_US
dc.contributor.authorSelçuk, A. A.en_US
dc.date.accessioned2016-02-08T10:02:29Z
dc.date.available2016-02-08T10:02:29Z
dc.date.issued2009-09-29en_US
dc.identifier.issn0020-0255
dc.identifier.urihttp://hdl.handle.net/11693/22617
dc.description.abstractBroadcast encryption (BE) deals with secure transmission of a message to a group of receivers such that only an authorized subset of receivers can decrypt the message. The transmission cost of a BE system can be reduced considerably if a limited number of free riders can be tolerated in the system. In this paper, we study the problem of how to optimally place a given number of free riders in a subset-difference (SD)-based BE system, which is currently the most efficient BE scheme in use and has also been incorporated in standards, and we propose a polynomial-time optimal placement algorithm and three more efficient heuristics for this problem. Simulation experiments show that SD-based BE schemes can benefit significantly from the proposed algorithms. © 2009 Elsevier Inc. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.source.titleInformation Sciencesen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ins.2009.05.025en_US
dc.subjectBroadcast encryptionen_US
dc.subjectDigital rights managementen_US
dc.subjectFree ridersen_US
dc.subjectGroup key managementen_US
dc.subjectSubset-difference schemeen_US
dc.titleOptimal subset-difference broadcast encryption with free ridersen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage3673en_US
dc.citation.epage3684en_US
dc.citation.volumeNumber179en_US
dc.citation.issueNumber20en_US
dc.identifier.doi10.1016/j.ins.2009.05.025en_US
dc.publisherElsevier Inc.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record