New constructions for IPP codes
This paper deals with codes with a traceability property, namely the so-called Identifiable Parent Property (IPP) codes, introduced to protect copyrighted digital data. Let \(C\) be and \((n,M,q)\)-code, \(w\geq 2\)\, an integer, and let \(desc_w(C)\)\, be the \(w\)-descendant code, defined as the set of \(n\)-tuples \(x\)\, that can be produced by a coalition of codewords \(C_0 \subset C\)\, of size at most \(w\) (i.e. \(x_i\in \{a_i; a\in C_0 \}, 1\leq i\leq n\)). Then \(C\)\, is called an IPP code if for all \(x\in desc_w(C)\)\, it holds that \(\cap_i\, C_i\) is not empty, where \(C_i\subset C\),\, of size at most \(w\)\, and \(x\in desc(C_i)\). IPP codes were introduced by \textit{H. Hollmann} et al. [J. Comb. Theory, Ser. A 82, 121--133 (1998; Zbl 0910.05070)] and its properties have been later studied by other authors. In particular \textit{J. Staddon} et al. [IEEE Trans. Inf. Theory 47, 1042--1049 (2001; Zbl 1001.94032)] show that error-correcting codes with ``sufficiently large distance are IPP codes. The present paper provides two explicit constructions methods for IPP codes using recursion techniques. The first construction, described in section 3, provides an infinite class of IPP codes with the best asymptotic behavior. Moreover the authors show that this codes have an efficient traitor tracing algorithm (TTA) with running time \(O(M)\) (traitor tracing schemes have been extensively studied for use against piracy. List decoding techniques of error correcting codes enable to construct traceability schemes with fast TTA). Previously the existence of TTA with running time \(O(M)\) was only known for the subclass of the so-called TA-codes, \textit{A. Silverberg} et al. [ASIACRYPT 2001, Lect. Notes Comput. Sci. 2248, 175--192 (2001; Zbl 1062.94552)]. Section 4 presents a new construction of perfect hash families and later uses this class to derive an infinite class of IPP codes.
- A class of traceability codes
- Analysis of two tracing traitor schemes via coding theory
- A class of I.P.P. codes with efficient identification
- Recursive constructions of secure codes and hash families using difference function families.
- On the relationship between the traceability properties of Reed-Solomon codes
- Combinatorial properties of frameproof and traceability codes
- Upper bounds for parent-identifying set systems
- scientific article; zbMATH DE number 1996248
- Codes with the Identifiable Parent Property and the Multiple-Access Channel
- scientific article; zbMATH DE number 1857520
- A Generalization of a Theorem due to MacNeish
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Explicit construction of exponential sized families of k-independent sets
- scientific article; zbMATH DE number 2081105 (Why is no real title available?)
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 1418305 (Why is no real title available?)
- scientific article; zbMATH DE number 1418306 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding algorithms for certain concatenated codes
- New results on frame-proof codes and traceability schemes
- On a class of traceability codes
- On codes with the identifiable parent property
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Tracing traitors
- Explicit constructions for perfect hash families
- Analysis of two tracing traitor schemes via coding theory
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Multimedia IPP codes with efficient tracing
- Generalization of IPP codes and IPP set systems
- On non-binary traceability set systems
- Bounds for separating hash families
- On generalized separating hash families
- Recursive constructions of secure codes and hash families using difference function families.
- Perfect hash families, identifiable parent property codes and covering arrays.
- Improved bounds for separating hash families
- On the relationship between the traceability properties of Reed-Solomon codes
- A class of traceability codes
- scientific article; zbMATH DE number 1857520 (Why is no real title available?)
- Codes with the identifiable parent property for multimedia fingerprinting
- Perfect Hash Families: Constructions and Existence
- Hat guessing number for the class of planar graphs is at least 22
- Covering array on the Cartesian product of hypergraphs
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
- Roux-type constructions for covering arrays of strengths three and four
- Explicit constructions of separating hash families from algebraic curves over finite fields
This page was built for publication: New constructions for IPP codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781000)
