Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1166
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAk, Murat-
dc.contributor.authorSelçuk, Ali Aydın-
dc.date.accessioned2019-06-26T07:40:35Z
dc.date.available2019-06-26T07:40:35Z
dc.date.issued2015-06-01
dc.identifier.citationAk, M., & Selçuk, A. A. (2015). Punctured interval broadcast encryption scheme with free riders. Information Sciences, 305, 285-301.en_US
dc.identifier.issn0020-0255
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0020025515000791?via%3Dihub-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/1166-
dc.description.abstractIn Broadcast Encryption (BE) schemes, the problem is to encrypt a content for a group of dynamically changing privileged (subscriber) subset within a receiver population. A popular approach is to carefully distribute a group of keys to several, carefully designed subsets of the receivers beforehand, and later use a precise subset of keys so that only intended users have those keys, thus decrypt the content. This approach is known as the subset cover framework. In the subset cover framework, one concern is the number of copies that must be encrypted, which affects the bandwidth requirement. This problem can be relaxed by allowing a limited number of free riders so that, by sacrificing some coverage accuracy, the transmission cost is reduced. Several BE schemes are proposed since 90s, and one of the most efficient schemes so far is the punctured interval BE scheme (Cheon et al., 2008). In this paper, we attack the problem of how to assign a given number of free riders effectively in the punctured interval BE scheme. We give the optimal free rider assignment algorithm which runs in poly(n) time, where n is the number of all users in the system, and we provide a heuristic which performs slightly worse than the optimal algorithm in terms of transmission cost reduction but is much faster, i.e., linear in terms of n. We also propose a hybrid approach which employs the core ideas of both optimal and heuristic methods in order to achieve a trade-off between speed and accuracy. (C) 2015 Elsevier Inc. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofInformation Sciencesen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBroadcast Encryptionen_US
dc.subjectFree Rideren_US
dc.subjectPunctured İntervalen_US
dc.subjectDigital Rights Managementen_US
dc.titlePunctured interval broadcast encryption scheme with free ridersen_US
dc.typeArticleen_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümütr_TR
dc.identifier.volume305
dc.identifier.startpage285
dc.identifier.endpage301
dc.relation.tubitakTurkish Scientific and Technological Research Agency (TUBITAK) [111E213]en_US
dc.identifier.wosWOS:000352037100018en_US
dc.identifier.scopus2-s2.0-84924368803en_US
dc.institutionauthorSelçuk, Ali Aydın-
dc.identifier.doi10.1016/j.ins.2015.02.001-
dc.authorscopusid7004457288-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.languageiso639-1en-
crisitem.author.dept02.3. Department of Computer Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

102
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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