Linear Code Implies Public-Key Traitor Tracing

Kaoru Kurosawa; Takuya Yoshida

Paper 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 $C$ such that $d \geq 2 k + 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.

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. This paper will appear in PKC 2002.
Keywords: broadcast traitor tracing
Contact author(s): kurosawa @ cis ibaraki ac jp
History: 2001-11-20: received
Short URL: https://ia.cr/2001/099
License: CC BY

BibTeX

@misc{cryptoeprint:2001/099,
      author = {Kaoru Kurosawa and Takuya Yoshida},
      title = {Linear Code Implies Public-Key Traitor Tracing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/099},
      year = {2001},
      url = {https://eprint.iacr.org/2001/099}
}