Fully Collusion-Resistant Trace-and-Revoke Scheme in Prime-Order Groups
- Authors
- Park, Jong Hwan; Rhee, Hyun Sook; Lee, Dong Hoon
- Issue Date
- 10월-2011
- Publisher
- KOREAN INST COMMUNICATIONS SCIENCES (K I C S)
- Keywords
- Bilinear maps; broadcast encryption; content distribution system; trace-and-revoke scheme
- Citation
- JOURNAL OF COMMUNICATIONS AND NETWORKS, v.13, no.5, pp.428 - 441
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- JOURNAL OF COMMUNICATIONS AND NETWORKS
- Volume
- 13
- Number
- 5
- Start Page
- 428
- End Page
- 441
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/111524
- DOI
- 10.1109/JCN.2011.6112299
- ISSN
- 1229-2370
- Abstract
- 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(root 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.
- 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.