Show simple item record

dc.contributor.advisorSelçuk, Ali Aydın
dc.contributor.authorAk, Murat
dc.date.accessioned2016-01-08T18:19:05Z
dc.date.available2016-01-08T18:19:05Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/11693/15473
dc.descriptionAnkara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.en_US
dc.descriptionThesis (Ph. D.) -- Bilkent University, 2012.en_US
dc.descriptionIncludes bibliographical refences.en_US
dc.description.abstractIn the last few decades, the use of digital content increased dramatically. Many forms of digital products in the form of CDs, DVDs, TV broadcasts, data over the Internet, entered our life. Classical cryptography, where encryption is done for only one recipient, was not able to handle this change, since its direct use leads to intolerably expensive transmissions. Moreover, new concerns regarding the commercial aspect arised. Since digital commercial contents are sold to various customers, unauthorized copying by malicious actors became a major concern and it needed to be prevented carefully. Therefore, a new research area called digital rights management (DRM) has emerged. Within the scope of DRM, new cryptographic primitives are proposed. In this thesis, we consider three of these: broadcast encryption (BE), traitor tracing (TT), and trace and revoke (T&R) schemes and propose methods to improve the performances and capabilities of these primitives. Particularly, we first consider profiling the recipient set in order to improve transmission size in the most popular BE schemes. We then investigate and solve the optimal free rider assignment problem for one of the most efficient BE schemes so far. Next, we attempt to close the non-trivial gap between BE and T&R schemes by proposing a generic method for adding traitor tracing capability to BE schemes and thus obtaining a T&R scheme. Finally, we investigate an overlooked problem: privacy of the recipient set in T&R schemes. Right now, most schemes do not keep the recipient set anonymous, and everybody can see who received a particular content. As a generic solution to this problem, we propose a method for obtaining anonymous T&R scheme by using anonymous BE schemes as a primitive.en_US
dc.description.statementofresponsibilityAk, Muraten_US
dc.format.extentxvii, 152 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBroadcast encryptionen_US
dc.subjecttraitor tracingen_US
dc.subjectdigital rights managementen_US
dc.subject.lccQA76.9.A25 A51 2012en_US
dc.subject.lcshData encryption (Computer science)en_US
dc.subject.lcshCryptography.en_US
dc.subject.lcshComputer security.en_US
dc.subject.lcshMultimedia systems--Security measures.en_US
dc.titleOptimization techniques and new methods for boradcast encryption and traitor tracing schemesen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record