Abstract
AbstractAccording to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper, further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference19 articles.
1. Barg A., Cohen G.D., Encheva S.B., Kabatiansky G., Zemor G.: A hypergraph approach to the identifying parent property: the case of multiple parents. Electron. Notes Discret. Math. 6, 1–3 (2001).
2. Barg A., Kabatiansky G.A.: A class of i.p.p. codes with efficient identification. J. Complexity 20(2–3), 137–147 (2004).
3. Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897–1905 (1998).
4. Cohen M., Fu H.-L., Jing J., Yuan-Hsun L., Ying M.: Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83, 11 (2014).
5. Chor B., Fiat A., Naor M.: Tracing traitors. Adv. Cryptol. Crypto’94. LNCS 839, 480–491 (1994).