Fully collusion-resistant trace-and-revoke scheme in prime-order groups

Jong Hwan Park, Hyun Sook Rhee, Dong Hoon Lee

Research output: Contribution to journalArticle

4 Citations (Scopus)

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(√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.

Original languageEnglish
Pages (from-to)428-441
Number of pages14
JournalJournal of Communications and Networks
Volume13
Issue number5
Publication statusPublished - 2011 Oct 1

Fingerprint

Cryptography
Videodisks
Composite materials
Water

Keywords

  • Bilinear maps
  • Broadcast encryption
  • Content distribution system
  • Trace-and-revoke scheme

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Fully collusion-resistant trace-and-revoke scheme in prime-order groups. / Park, Jong Hwan; Rhee, Hyun Sook; Lee, Dong Hoon.

In: Journal of Communications and Networks, Vol. 13, No. 5, 01.10.2011, p. 428-441.

Research output: Contribution to journalArticle

@article{75ad41530a90405e91181411b41d9c34,
title = "Fully collusion-resistant trace-and-revoke scheme in prime-order groups",
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(√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.",
keywords = "Bilinear maps, Broadcast encryption, Content distribution system, Trace-and-revoke scheme",
author = "Park, {Jong Hwan} and Rhee, {Hyun Sook} and Lee, {Dong Hoon}",
year = "2011",
month = "10",
day = "1",
language = "English",
volume = "13",
pages = "428--441",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "5",

}

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

PY - 2011/10/1

Y1 - 2011/10/1

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

UR - http://www.scopus.com/inward/citedby.url?scp=81555211953&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:81555211953

VL - 13

SP - 428

EP - 441

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 5

ER -