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.
| Original language | English |
|---|---|
| Pages (from-to) | 255-276 |
| Number of pages | 22 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 60 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2011 Sep 1 |
Fingerprint
Keywords
- Bilinear maps
- Broadcast encryption
- Collusion-resistance
- Piracy
- Traitor tracing
ASJC Scopus subject areas
- Applied Mathematics
- Computer Science Applications
Cite this
Fully collusion-resistant traitor tracing scheme with shorter ciphertexts. / Park, Jong Hwan; Lee, Dong Hoon.
In: Designs, Codes, and Cryptography, Vol. 60, No. 3, 01.09.2011, p. 255-276.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
AU - Park, Jong Hwan
AU - Lee, Dong Hoon
PY - 2011/9/1
Y1 - 2011/9/1
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
VL - 60
SP - 255
EP - 276
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
SN - 0925-1022
IS - 3
ER -