Welcome to the resource topic for 2001/099
Title:
Linear Code Implies Public-Key Traitor Tracing
Authors: Kaoru Kurosawa, 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.
ePrint: https://eprint.iacr.org/2001/099
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .