In this paper, we present several explicit constructions of $q$-ary 2-SFPCs. 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. 149--162, 2002]. The length of our new code is logarithmically small compared to its size.
Category / Keywords: combinatorial cryptography, fingerprinting codes, secure frameproof codes, traitor tracing Publication Info: International Journal of Pure and Applied Mathematics, Volume 6, No. 3, 2003, 343-360 Date: received 16 Aug 2005, last revised 17 Aug 2005 Contact author: dong at uow edu au Available format(s): PDF | BibTeX Citation Note: This is the revised version of the paper published in International Journal of Pure and Applied Mathematics, volume 6 no. 3, 2003, 343-360.
Version: 20050817:232701 (All versions of this report) Short URL: ia.cr/2005/275 Discussion forum: Show discussion | Start new discussion