Show simple item record

dc.contributor.authorAk, M.en_US
dc.contributor.authorKaya, K.en_US
dc.contributor.authorOnarlıoglu, K.en_US
dc.contributor.authorSelçuk, A. A.en_US
dc.date.accessioned2015-07-28T11:59:46Z
dc.date.available2015-07-28T11:59:46Z
dc.date.issued2010-03-15en_US
dc.identifier.issn0020-0255
dc.identifier.urihttp://hdl.handle.net/11693/12030
dc.description.abstractBroadcast encryption (BE) deals with secure transmission of a message to a group Of users such that only an authorized subset of users can decrypt the message. Some of the most effective BE schemes in the literature are the tree-based schemes of complete subtree (CS) and subset difference (SD). The key distribution trees in these schemes are traditionally constructed without considering user preferences In fact these schemes can be made significantly more efficient when user profiles are taken into account In tills paper, we consider this problem and study how to construct the CS and SD trees more efficiently according to user profiles. We first analyze the relationship between the transmission cost and the user profile distribution and prove a number of key results in this aspect. Then we propose several optimization algorithms which can reduce the bandwidth requirement of the CS and SD schemes significantly. This reduction becomes even more significant when a number of free riders can be allowed in the system. (C) 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.11.024en_US
dc.subjectBroadcast encryptionen_US
dc.subjectCS schemeen_US
dc.subjectSD schemeen_US
dc.subjectUser profilesen_US
dc.subjectKey managementen_US
dc.subjectFree ridersen_US
dc.subjectRevocationen_US
dc.titleEfficient broadcast encryption with user profilesen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage1060en_US
dc.citation.epage1072en_US
dc.citation.volumeNumber180en_US
dc.citation.issueNumber6en_US
dc.identifier.doi10.1016/j.ins.2009.11.024en_US
dc.publisherElsevier Inc.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record