IACR paper details
Title  Explicit Construction of Secure Frameproof Codes 

Booktitle  IACR Eprint archive 

Pages  

Year  2005 

URL  http://eprint.iacr.org/2005/275 

Author  Dongvu Tonien 

Author  Reihaneh SafaviNaini 

Abstract 
$\Gamma$ is a $q$ary code of length $L$. A word $w$ is called a descendant of a coalition of codewords $w^{(1)}, w^{(2)}, \dots, w^{(t)}$ of $\Gamma$ if at each position $i$, $1 \leq i \leq L$, $w$ inherits a symbol from one of its parents, that is $w_i \in \{ w^{(1)}_i, w^{(2)}_i, \dots, w^{(t)}_i \}$. A $k$secure frameproof code ($k$SFPC) ensures that any two disjoint coalitions of size at most $k$ have no common descendant. Several probabilistic methods prove the existance of codes but there are not many explicit constructions. Indeed, it is an open problem in [J. Staddon et al.,
IEEE Trans. on Information Theory, 47 (2001), pp. 10421049] to construct explicitly $q$ary 2secure frameproof code for arbitrary $q$.
In this paper, we present several explicit constructions of $q$ary 2SFPCs. These constructions are generalisation of the binary inner code of the secure code in [V.D. To et al., Proceeding of IndoCrypt'02, LNCS 2551, pp. 149162, 2002]. The length of our new code is logarithmically small compared to its size.


Search for the paper
@misc{eprint200512609,
title={Explicit Construction of Secure Frameproof Codes},
booktitle={IACR Eprint archive},
keywords={combinatorial cryptography, fingerprinting codes, secure frameproof codes, traitor tracing},
url={http://eprint.iacr.org/2005/275},
note={International Journal of Pure and Applied Mathematics, Volume 6, No. 3, 2003, 343360 dong@uow.edu.au 13012 received 16 Aug 2005, last revised 17 Aug 2005},
author={Dongvu Tonien and Reihaneh SafaviNaini},
year=2005
}
Download a complete BibTeX file.