International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Linear Code Implies Public-Key Traitor Tracing

Authors:
Kaoru Kurosawa
Takuya Yoshida
Download:
URL: http://eprint.iacr.org/2001/099
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2001-11511,
  title={Linear Code Implies Public-Key Traitor Tracing},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / broadcast, traitor tracing},
  url={http://eprint.iacr.org/2001/099},
  note={This paper will appear in PKC 2002. kurosawa@cis.ibaraki.ac.jp 11646 received 19 Nov 2001},
  author={Kaoru Kurosawa and Takuya Yoshida},
  year=2001
}