Citation: |
[1] |
A. Barg, G. R. Blakley and G. A. Kabatiansky, Digital fingerprinting codes: problem statements, constructions, identification of traitors, IEEE Trans. Inform. Theory, 49 (2003), 852-865.doi: 10.1109/TIT.2003.809570. |
[2] |
D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, in "Advances in Cryptology--CRYPTO'95 (Santa Barbara, CA),'' Springer, (1995), 452-465.doi: 10.1007/3-540-44750-4_36. |
[3] |
D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Trans. Inform. Theory, 44 (1998), 1897-1905.doi: 10.1109/18.705568. |
[4] |
B. Chor, A. Fiat and M. Naor, Tracing traitors, in "Advances in Cryptology--CRYPTO'94 (Santa Barbara, CA),'' Springer, (1994), 480-491. |
[5] |
B. Chor, A. Fiat, M. Naor and B. Pinkas, Tracing traitors, IEEE Trans. Inform. Theory, 46 (2000), 893-910.doi: 10.1109/18.841169. |
[6] |
G. D. Cohen and H. G. Schaathun, Asymptotic overview on separating codes, Tech. Report 248, Dep. Informatics, Univ. Bergen, Norway, 2003. |
[7] |
G. D. Cohen and H. G. Schaathun, Upper bounds on separating codes, IEEE Trans. Inform. Theory, 50 (2004), 1291-1294.doi: 10.1109/TIT.2004.828140. |
[8] |
M. Fernandez, J. Cotrina, M. Soriano and N. Domingo, A note about the identifier parent property in Reed-Solomon codes, Comput. Security, 29 (2010), 628-635.doi: 10.1016/j.cose.2009.12.012. |
[9] |
A. D. Friedman, R. L. Graham and J. D. Ullman, Universal single transition time asynchronous state assignments, IEEE Trans. Comput., C-18 (1969), 541-547.doi: 10.1109/T-C.1969.222707. |
[10] |
H. D. L. Hollmann, J. H. van Lint, J.-P. Linnartz and L. M. G. M. Tolhuizen, On codes with the identifiable parent property, J. Combin. Theory Ser. A, 82 (1998), 121-133.doi: 10.1006/jcta.1997.2851. |
[11] |
H. Jin and M. Blaum, Combinatorial properties for traceability codes using error correcting codes, IEEE Trans. Inform. Theory, 53 (2007), 804-808.doi: 10.1109/TIT.2006.889730. |
[12] |
J. Körner and G. Simonyi, Separating partition systems and locally different sequences, SIAM J. Discr. Math., 1 (1988), 355-359.doi: 10.1137/0401035. |
[13] |
R. Lidl and H. Niederreiter, "Introduction to Finite Fields and their Applications,'' revised edition, Cambridge University Press, UK, 1994.doi: 10.1017/CBO9781139172769. |
[14] |
M. S. Pinsker and Y. L. Sagalovich, Lower bound on the cardinality of code of automata's states, Probl. Inform. Transm., 8 (1972), 59-66. |
[15] |
I. S. Reed and G. Solomon, Polynomial codes over certain finite fields, SIAM J. Appl. Math., 8 (1960), 300-304.doi: 10.1137/0108018. |
[16] |
Y. L. Sagalovich, Completely separating systems, Probl. Inform. Transm., 18 (1982), 140-146. |
[17] |
Y. L. Sagalovich, Separating systems, Probl. Inform. Transm., 30 (1994), 105-123. |
[18] |
A. Silverberg, J. Staddon and J. L. Walker, Efficient traitor tracing algorithms using list decoding, in "Advances in Cryptology--ASIACRYPT 2001 (Gold Coast, Australia),'' Springer, (2001), 175-192.doi: 10.1007/3-540-45682-1_11. |
[19] |
A. Silverberg, J. Staddon and J. L. Walker, Applications of list decoding to tracing traitors, IEEE Trans. Inform. Theory, 49 (2003), 1312-1318.doi: 10.1109/TIT.2003.810630. |
[20] |
J. N. Staddon, D. R. Stinson and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory, 47 (2001), 1042-1049.doi: 10.1109/18.915661. |
[21] |
D. R. Stinson, T. van Trung and R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Stat. Plan. Infer., 86 (2000), 595-617.doi: 10.1016/S0378-3758(99)00131-7. |