Design theory
Separating partition systems and locally different sequences
SIAM Journal on Discrete Mathematics
Handbook of Coding Theory
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
On Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
| Hi-index | 0.00 |
If 驴 is a q-ary code of length n and a, b, ..., e are codewords, then c is called a descendant of a, b, ..., e if ci 驴 {ai, bi, ..., ei} for i = 1, ..., n. Codes 驴 with the property that coalitions of a limited size have restrictions on their descendants are studied. Namely, we consider codes with the following partial identification property, referred to later as 2- secure frameproof codes (2-SFPC): any two non intersecting coalitions of size at most 2 have no common descendant.