A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents

Authors:
Barg A.;Cohen G.;Encheva S.;Kabatiansky G.;Zemor G.
Affiliations:
-;-;-;-;-
Venue:
A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents
Year:
2000

Citing 0
Cited 2

Frameproof and IPP Codes

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Efficient Traitor Tracing Algorithms Using List Decoding

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let $C$ be a code of length $n$ over an alphabet of $q$ letters. A codeword $y$ is called a descendant of a set of $t$ codewords $ x^1,\dots,x^t$ if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all $i=1,\dots,n.$ A code is said to have the identifiable parent property if for any $n$-word that is a descendant of at most $t$ parents it is possible to identify at least one of them. We prove that for any $t\le q-1$ there exist sequences of such codes with asymptotically nonvanishing rate.