Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
- Authors
- Park, Jong Hwan; Lee, Dong Hoon
- Issue Date
- 9월-2011
- Publisher
- SPRINGER
- Keywords
- Traitor tracing; Broadcast encryption; Collusion-resistance; Piracy; Bilinear maps
- Citation
- DESIGNS CODES AND CRYPTOGRAPHY, v.60, no.3, pp.255 - 276
- Indexed
- SCIE
SCOPUS
- Journal Title
- DESIGNS CODES AND CRYPTOGRAPHY
- Volume
- 60
- Number
- 3
- Start Page
- 255
- End Page
- 276
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/111655
- DOI
- 10.1007/s10623-010-9431-7
- ISSN
- 0925-1022
- Abstract
- A traitor tracing scheme allows a content distributor to detect at least one of the traitors whose secret key is used to create a pirate decoder. In building efficient traitor tracing schemes, reducing ciphertext size is a significant factor since the traitor tracing scheme must handle a larger number of users. In this paper, we present a fully collusion-resistant traitor tracing scheme where the ciphertext size is 2.8 times shorter and encryption time is 2.6 times faster, compared to the best cases of fully collusion-resistant schemes previously suggested. We can achieve these efficiency results without sacrificing other costs. Also, our scheme supports public tracing and black-box tracing. To achieve our goal, we use asymmetric bilinear maps in prime order groups, and we introduce a new cancellation technique that has the same effect as that in composite order groups.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.