A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing

Tatsuyuki MATSUSHITA; Hideki IMAI

doi:10.1093/ietfec/e88-a.4.1055

A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing

Tatsuyuki MATSUSHITA, Hideki IMAI

Full Text Views

0

Share
Cite this

Summary :

We propose a new type of revocation scheme for efficient public-key black-box traitor tracing. Our revocation scheme is flexible and efficient in the sense that (i) any number of subscribers can be revoked in each distribution under an assumption that the number of revoked subscribers who collude in one coalition is limited to a threshold and (ii) both each subscriber's storage and the transmission overhead are independent of n, while (i) the maximum number of revoked ones cannot be changed or (ii) they depend on n in previous schemes, where n is the total number of subscribers. The flexibility in revocation is significant since flexible revocation can be integrated with efficient black-box tracing and this integration can be achieved without a substantial increase in the transmission overhead over the previous schemes. In this paper, we present a concrete construction of an efficient public-key black-box traceable and revocable scheme by combining flexible revocation with a known black-box tracing algorithm which works under the same attack model as assumed in the previous schemes. Our scheme achieves that (i) the transmission overhead remains efficient, especially linear only in k in case of bulk revocation and (ii) the tracing algorithm runs in O(log n) time, while the previous ones cannot satisfy both of these properties, where k is the maximum number of traitors in a coalition.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.4 pp.1055-1062

Publication Date: 2005/04/01

Publicized

Online ISSN

DOI: 10.1093/ietfec/e88-a.4.1055

Type of Manuscript: PAPER

Category: Information Security

Cite this

Copy

Tatsuyuki MATSUSHITA, Hideki IMAI, "A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing" in IEICE TRANSACTIONS on Fundamentals, vol. E88-A, no. 4, pp. 1055-1062, April 2005, doi: 10.1093/ietfec/e88-a.4.1055.
Abstract: We propose a new type of revocation scheme for efficient public-key black-box traitor tracing. Our revocation scheme is flexible and efficient in the sense that (i) any number of subscribers can be revoked in each distribution under an assumption that the number of revoked subscribers who collude in one coalition is limited to a threshold and (ii) both each subscriber's storage and the transmission overhead are independent of n, while (i) the maximum number of revoked ones cannot be changed or (ii) they depend on n in previous schemes, where n is the total number of subscribers. The flexibility in revocation is significant since flexible revocation can be integrated with efficient black-box tracing and this integration can be achieved without a substantial increase in the transmission overhead over the previous schemes. In this paper, we present a concrete construction of an efficient public-key black-box traceable and revocable scheme by combining flexible revocation with a known black-box tracing algorithm which works under the same attack model as assumed in the previous schemes. Our scheme achieves that (i) the transmission overhead remains efficient, especially linear only in k in case of bulk revocation and (ii) the tracing algorithm runs in O(log n) time, while the previous ones cannot satisfy both of these properties, where k is the maximum number of traitors in a coalition.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.4.1055/_p

Copy

@ARTICLE{e88-a_4_1055,
author={Tatsuyuki MATSUSHITA, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing},
year={2005},
volume={E88-A},
number={4},
pages={1055-1062},
abstract={We propose a new type of revocation scheme for efficient public-key black-box traitor tracing. Our revocation scheme is flexible and efficient in the sense that (i) any number of subscribers can be revoked in each distribution under an assumption that the number of revoked subscribers who collude in one coalition is limited to a threshold and (ii) both each subscriber's storage and the transmission overhead are independent of n, while (i) the maximum number of revoked ones cannot be changed or (ii) they depend on n in previous schemes, where n is the total number of subscribers. The flexibility in revocation is significant since flexible revocation can be integrated with efficient black-box tracing and this integration can be achieved without a substantial increase in the transmission overhead over the previous schemes. In this paper, we present a concrete construction of an efficient public-key black-box traceable and revocable scheme by combining flexible revocation with a known black-box tracing algorithm which works under the same attack model as assumed in the previous schemes. Our scheme achieves that (i) the transmission overhead remains efficient, especially linear only in k in case of bulk revocation and (ii) the tracing algorithm runs in O(log n) time, while the previous ones cannot satisfy both of these properties, where k is the maximum number of traitors in a coalition.},
keywords={},
doi={10.1093/ietfec/e88-a.4.1055},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - A Flexible-Revocation Scheme for Efficient Public-Key Black-Box Traitor Tracing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1055
EP - 1062
AU - Tatsuyuki MATSUSHITA
AU - Hideki IMAI
PY - 2005
DO - 10.1093/ietfec/e88-a.4.1055
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2005
AB - We propose a new type of revocation scheme for efficient public-key black-box traitor tracing. Our revocation scheme is flexible and efficient in the sense that (i) any number of subscribers can be revoked in each distribution under an assumption that the number of revoked subscribers who collude in one coalition is limited to a threshold and (ii) both each subscriber's storage and the transmission overhead are independent of n, while (i) the maximum number of revoked ones cannot be changed or (ii) they depend on n in previous schemes, where n is the total number of subscribers. The flexibility in revocation is significant since flexible revocation can be integrated with efficient black-box tracing and this integration can be achieved without a substantial increase in the transmission overhead over the previous schemes. In this paper, we present a concrete construction of an efficient public-key black-box traceable and revocable scheme by combining flexible revocation with a known black-box tracing algorithm which works under the same attack model as assumed in the previous schemes. Our scheme achieves that (i) the transmission overhead remains efficient, especially linear only in k in case of bulk revocation and (ii) the tracing algorithm runs in O(log n) time, while the previous ones cannot satisfy both of these properties, where k is the maximum number of traitors in a coalition.
ER -