Year-end Sale % OFF 
Abstract
Fingerprinting codes are used to prevent dishonest users (traitors) from redistributing digital contents. In this context, codes with the traceability (TA) property and codes with the identifiable parent property (IPP) allow the unambiguous identification of traitors. The existence conditions for IPP codes are less strict than those for TA codes. In contrast, IPP codes do not have an efficient decoding algorithm in the general case. Other codes that have been widely studied but possess weaker identification capabilities are separating codes. It is a well-known result that a TA code is an IPP code, and an IPP code is a separating code. The converse is in general false. However, it has been conjectured that for Reed-Solomon codes all three properties are equivalent. In this paper we investigate this equivalence, providing a positive answer when the number of traitors divides the size of the ground field.
Highlights
Distributing digital contents is an activity which is prone to an undesirable attack: unauthorized redistributions performed by dishonest users
We summarize here the results shown in the paper for the case of Reed-Solomon codes, RS(n, k)
Our main goal was to give an answer to the question posed by Silverberg et al in [18, 19]: Is it the case that d > (1 − 1/c2)n for all c-identifiable parent property (IPP) Reed-Solomon codes of length n and minimum distance d?
Summary
Distributing digital contents is an activity which is prone to an undesirable attack: unauthorized redistributions performed by dishonest users. A stronger traitor tracing scheme would provide, besides that, a mechanism to identify at least one of the traitors This goal is achieved if the set of marks chosen by the distributor constitutes a code with tracing properties. Codes with tracing properties can be classified according to their capabilities in terms of protecting innocent users and identifying traitors. These properties are not equivalent in the general case.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
