Linear Code Implies Public-Key Traitor Tracing

  • Authors:
  • Kaoru Kurosawa;Takuya Yoshida

  • Affiliations:
  • -;-

  • Venue:
  • PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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 驴 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.