Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
Theoretical Computer Science
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
SIAM Journal on Discrete Mathematics
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
List decoding of error-correcting codes
List decoding of error-correcting codes
On a Class of Traceability Codes
Designs, Codes and Cryptography
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
New results on frame-proof codes and traceability schemes
IEEE Transactions on Information Theory
Recursive constructions of secure codes and hash families using difference function families
Journal of Combinatorial Theory Series A
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography
Explicit constructions of separating hash families from algebraic curves over finite fields
Designs, Codes and Cryptography
On generalized separating hash families
Journal of Combinatorial Theory Series A
Explicit constructions for perfect hash families
Designs, Codes and Cryptography
A combinatorial approach to X-tolerant compaction circuits
IEEE Transactions on Information Theory
Mediated traceable anonymous encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Bounds for separating hash families
Journal of Combinatorial Theory Series A
Traitor tracing for stateful pirate decoders with constant ciphertext rate
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Generic construction of hybrid public key traitor tracing with full-public-traceability
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A collusion attack optimization strategy for digital fingerprinting
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
Improved bounds for separating hash families
Designs, Codes and Cryptography
| Hi-index | 0.06 |
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit construction methods for IPP codes by means of recursion techniques. The first method directly constructs IPP codes, whereas the second constructs perfect hash families that are then used to derive IPP codes. In fact, the first construction provides an infinite class of IPP codes having the best known asymptotic behavior. We also prove that this class has a traitor tracing algorithm with a runtime of O(M) in general, where M is the number of codewords.