TY - JOUR
T1 - Fully collusion-resistant trace-and-revoke scheme in prime-order groups
AU - Park, Jong Hwan
AU - Rhee, Hyun Sook
AU - Lee, Dong Hoon
N1 - Funding Information:
This work was supported by a grant from the College of Applied Science, Kyung Hee University Research Professor fellowship, Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (no. 2010-0003388), and the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (no. 2010-0029121).
PY - 2011/10
Y1 - 2011/10
N2 - A trace-and-revoke scheme is a type of broadcast encryption scheme for content protection on various platforms such as pay-per-view TV and DVD players. In 2006, Boneh and Waters (BW) presented a fully collusion-resistant trace-and-revoke scheme. However, a decisive drawback of their scheme is to require composite-order groups. In this paper, we present a new trace-and-revoke scheme that works in prime-order groups. Our scheme is fully collusion-resistant and achieves ciphertexts and private keys of size O(√N) for N users. For the same level of security, our scheme is better than the BW scheme in all aspects of efficiency. Some superior features include 8.5 times faster encryption, 12 times faster decryption, and 3.4 times shorter ciphertexts. To achieve our goal, we introduce a novel technique where, by using asymmetric bilinear maps in prime-order groups, the cancellation effect same as in composite-order groups can be obtained.
AB - A trace-and-revoke scheme is a type of broadcast encryption scheme for content protection on various platforms such as pay-per-view TV and DVD players. In 2006, Boneh and Waters (BW) presented a fully collusion-resistant trace-and-revoke scheme. However, a decisive drawback of their scheme is to require composite-order groups. In this paper, we present a new trace-and-revoke scheme that works in prime-order groups. Our scheme is fully collusion-resistant and achieves ciphertexts and private keys of size O(√N) for N users. For the same level of security, our scheme is better than the BW scheme in all aspects of efficiency. Some superior features include 8.5 times faster encryption, 12 times faster decryption, and 3.4 times shorter ciphertexts. To achieve our goal, we introduce a novel technique where, by using asymmetric bilinear maps in prime-order groups, the cancellation effect same as in composite-order groups can be obtained.
KW - Bilinear maps
KW - Broadcast encryption
KW - Content distribution system
KW - Trace-and-revoke scheme
UR - http://www.scopus.com/inward/record.url?scp=81555211953&partnerID=8YFLogxK
U2 - 10.1109/JCN.2011.6112299
DO - 10.1109/JCN.2011.6112299
M3 - Article
AN - SCOPUS:81555211953
SN - 1229-2370
VL - 13
SP - 428
EP - 441
JO - Journal of Communications and Networks
JF - Journal of Communications and Networks
IS - 5
ER -