Linear Code Implies Public-Key Traitor Tracing.
Kaoru Kurosawa, Takuya Yoshida · 2001
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 BonehFranklin scheme is equivalent to a slight modification of the corrected KurosawaDesmedt 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. 1