Abstract
We propose a new type of revocation scheme for efficient public-key black-box traitor tracing. Our revocation scheme is flexible in the sense that 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, while the maximum number of revoked ones cannot be changed in previous schemes. 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 an efficient public-key revocable and black-box-traceable scheme by combining flexible revocation with two known black-box-tracing algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Anzai, N. Matsuzaki, and T. Matsumoto: “A Quick Group Key Distribution Scheme with “Entity Revocation””, In Proc. of ASIACRYPT’ 99, LNCS 1716, Springer-Verlag, pp. 333–347, 1999.
D. Boneh: “The Decision Diffie-Hellman Problem”, In Proc. of the Third Algorithmic Number Theory Symposium, LNCS 1423, Springer-Verlag, pp. 48–63, 1998.
D. Boneh and M. Franklin: “An Efficient Public Key Traitor Tracing Scheme”, In Proc. of CRYPTO’ 99, LNCS 1666, Springer-Verlag, pp. 338–353, 1999.
B. Chor, A. Fiat, and M. Naor: “Tracing Traitors”, In Proc. of CRYPTO’ 94, LNCS 839, Springer-Verlag, pp. 257–270, 1994.
K. Kurosawa and Y. Desmedt: “Optimum Traitor Tracing and Asymmetric Schemes”, In Proc. of EUROCRYPT’ 98, LNCS 1403, Springer-Verlag, pp. 145–157, 1998.
T. Matsushita, K. Kobara, and H. Imai: “Revocable Black-box Tracing against Self-Defensive Pirate Decoders”, In Proc. of the 2nd Workshop on Information Security Applications (WISA’ 01), pp. 335–353, September 2001.
M. Naor and B. Pinkas: “Threshold Traitor Tracing”, In Proc. of CRYPTO’ 98, LNCS 1462, Springer-Verlag, pp. 502–517, 1998.
M. Naor and B. Pinkas: “Efficient Trace and Revoke Schemes”, In Proc. of Financial Cryptography’ 00, LNCS 1962, Springer-Verlag, pp. 1–20, February 2000.
D. R. Stinson and R. Wei: “Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes” SIAM Journal on Discrete Mathematics, Vol. 11, No. 1, pp. 41–53, 1998.
W. Tzeng and Z. Tzeng: “A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares”, In Proc. of PKC’ 01, LNCS 1992, Springer-Verlag, pp. 207–224, 2001.
Y. Watanabe, G. Hanaoka, and H. Imai: “Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents”, CT-RSA’ 01, pp. 392–407, 2001.
M. Yoshida and T. Fujiwara: “A Subscriber-Excluding and Traitor-Tracing Broadcast Distribution System”, IEICE Trans. Fundamentals, Vol. E84-A, No. 1, pp. 247–255, January 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsushita, T. (2002). A Flexibly Revocable Key-Distribution Scheme for Efficient Black-Box Tracing. In: Deng, R., Bao, F., Zhou, J., Qing, S. (eds) Information and Communications Security. ICICS 2002. Lecture Notes in Computer Science, vol 2513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36159-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-36159-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00164-5
Online ISBN: 978-3-540-36159-6
eBook Packages: Springer Book Archive