Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
Theoretical Computer Science
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
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Reed Solomon Codes for Digital Fingerprinting
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
New Constructions for IPP Codes
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
Linear hash families and forbidden configurations
Designs, Codes and Cryptography
Traitors Collaborating in Public: Pirates 2.0
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
Frameproof and identifying parent property codes and their relationship to hash families and error correcting codes are studied. A upper bound on the size of such codes is presented. A generalization of identifying parent property is introduced and studied in terms of a new class of hash families - the strong separating hash families. Asymptotic consequences of some recursive construction techniques are described.