Abstract
Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon–Stinson–Wei's problem of the existence of traceability codes with q< w 2 and b>q. We provide a large class of these codes constructed by using a new general construction method for q-ary codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. T. Bogdanova, A. E. Brouwer, S. N. Kapralov and P. R. J. Östergrård, Error-correcting codes over an alphabet of four elements, Designs, Codes and Cryptography, Vol. 23 (2001) pp. 333-342.
D. Boneh and M. Franklin, An efficient public keys traitor tracing schemes, In Advanced in Cryptology-Crypto'99 (Lecture Notes in Computer Science), Springer-Verlag, Vol. 1666 (1999) pp. 338-353.
D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp. 1897-1905.
B. Chor, A. Fiat and M. Naor, Tracing traitors, In Advances in Cryptology-Crypto'94 (Lecture Notes in Computer Science), Springer-Verlag, Vol. 839 (1994) pp. 257-270.
B. Chor, A. Fiat, M. Naor and B. Pinkas, Tracing traitors, IEEE Trans. Inform. Theory, Vol. 46 (2000) pp. 480-491.
C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).
P. Erdös, P. Frankl and Z. Füredi, Families of finite sets in which no set is covered by the union of r other, Israel Journal of Mathematics, Vol. 51 (1985) pp. 75-89.
A. Fiat and T. Tassa, Dynamic traitor tracing, In Advances in Cryptology Crypto'99 (Lecture Notes in Computer Science), Springer-Verlag, Vol. 1666 (1999) pp. 354-371.
A. Fiat and T. Tassa, Dynamic traitor tracing, J. Cryptology, Vol. 14 (2001) pp. 211-223.
E. Gafni, J. Staddon and Y. L. Yin, Efficient methods for integrating traceability and broadcast encryption, In Advances in Cryptology-Crypto'99 (Lecture Notes in Computer Science), Springer-Verlag, Vol. 1666 (1999) pp. 372-387.
R. Kumar, S. Rajagopalan and A. Sahai, Coding constructions for blacklisting problems without computational assumptions, In Advances in Cryptology-Crypto'99 (Lecture Notes in Computer Science), Springer-Verlag, Vol. 1666 (1999) pp. 609-623.
K. Kurosawa, T. Yoshida and Y. Desmedt, Inherently large traceability and asymmetric schemes with arbiter, In Proc. IEEE Int. Symp. Inform. Theory (ISIT'2000), Sorrento, Italy, June (2000).
J. N. Staddon, D. R. Stinson and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory, Vol. 47 (2001) pp. 1042-1049.
D. R. Stinson and R. Wei, Combinatorial properties and constructions of traceability schemes and frameproof codes, SIAM J.Discrete Math., Vol. 11 (1998) pp. 41-53.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van Trung, T., Martirosyan, S. On a Class of Traceability Codes. Designs, Codes and Cryptography 31, 125–132 (2004). https://doi.org/10.1023/B:DESI.0000012440.32810.23
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000012440.32810.23