Abstract
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c 2 < n/(n − d). In this paper, we show that a less restrictive condition can be derived. In other words, there exists a value Z C , with n − d ≤ Z C ≤ c(n − d), such that any linear code is c-TA if c < n/Z C . We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 480–491. Springer, Heidelberg (1994)
Chor, B., Fiat, A., Naor, M., Pinkas, B.: Tracing traitors. IEEE Trans. Inform. Theory 46, 893–910 (2000)
Fernandez, M., Soriano, M.: Identification of traitors in algebraic-geometric traceability codes. IEEE Transactions on Signal Processing 52(10), 3073–3077 (2004)
Jin, H., Blaum, M.: Combinatorial properties for traceability codes using error correcting codes. IEEE Transactions on Information Theory 53(2), 804–808 (2007)
Lindkvist, T., Löfvenberg, J., Svanström, M.: A class of traceability codes. IEEE Transactions on Information Theory 48(7), 2094–2096 (2002)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)
Safavi-Naini, R., Wang, Y.: New results on frame-proof codes and traceability schemes. IEEE Transactions on Information Theory 47(7), 3029–3033 (2001)
Silverberg, A., Staddon, J., Walker, J.L.: Applications of list decoding to tracing traitors. IEEE Transactions on Information Theory 49(5), 1312–1318 (2003)
Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory 47(3), 1042–1049 (2001)
van Trung, T., Martirosyan, S.: On a class of traceability codes. Des. Codes Cryptography 31(2), 125–132 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandez, M., Cotrina, J., Soriano, M., Domingo, N. (2007). A Note About the Traceability Properties of Linear Codes. In: Nam, KH., Rhee, G. (eds) Information Security and Cryptology - ICISC 2007. ICISC 2007. Lecture Notes in Computer Science, vol 4817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76788-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-76788-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76787-9
Online ISBN: 978-3-540-76788-6
eBook Packages: Computer ScienceComputer Science (R0)