TY - JOUR
T1 - Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
AU - Park, Jong Hwan
AU - Lee, Dong Hoon
N1 - Funding Information:
Acknowledgements The authors thank the reviewers for their helpful comments and suggestions for this paper. The first author was supported by a grant from the College of Applied Science, Kyung Hee University research professor fellowship. The second author was supported by Ministry of Culture, Sports and Tourism(MCST) and Korea Culture Content Agency(KOCCA) in the Culture Technology(CT) Research & Development Program 2010. The second author was the corresponding author.
PY - 2011/9
Y1 - 2011/9
N2 - 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.
AB - 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.
KW - Bilinear maps
KW - Broadcast encryption
KW - Collusion-resistance
KW - Piracy
KW - Traitor tracing
UR - http://www.scopus.com/inward/record.url?scp=79959373851&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959373851&partnerID=8YFLogxK
U2 - 10.1007/s10623-010-9431-7
DO - 10.1007/s10623-010-9431-7
M3 - Article
AN - SCOPUS:79959373851
VL - 60
SP - 255
EP - 276
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
SN - 0925-1022
IS - 3
ER -