Cryptology ePrint Archive: Report 2001/099

Linear Code Implies Public-Key Traitor Tracing

Kaoru Kurosawa and Takuya Yoshida

Abstract: In this paper, we first show that three public-key $(k,n)$-traceability schemes can be derived from an $[n,u,d]$-linear code ${\cal C}$ such that $d \geq 2k+1$. The previous schemes are obtained as special cases. This observation gives a more freedom and a new insight to this field. For example, we show that Boneh-Franklin scheme is equivalent to a slight modification of the corrected Kurosawa-Desmedt scheme. This means that BF scheme is redundant or overdesigned because the modified KD scheme is much simpler. It is also shown that the corrected KD scheme is the best among them.

Category / Keywords: public-key cryptography / broadcast, traitor tracing

Publication Info: This paper will appear in PKC 2002.

Date: received 19 Nov 2001

Contact author: kurosawa at cis ibaraki ac jp

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20011120:173314 (All versions of this report)

Short URL: ia.cr/2001/099