Linear Code Implies Public-Key Traitor Tracing
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.
- 1.M. Bellare, A. Boldyreva and S. Micali, “Public-key encryption in a multi-user setting: Security proofs and improvements,” Proceedings of EUROCRYPT 2000, LNCS 1807, Springer Verlag, pp.259–274, 2000.Google Scholar
- 2.D. Boneh and M. Franklin, “An efficient public key traitor tracing scheme (Extended Abstract),” Proceedings of CRYPTO’ 99, LNCS 1666, Springer Verlag, pp.338–353, 1999.Google Scholar
- 3.D. Boneh and M. Franklin, “An efficient public key traitor tracing scheme (fullversion of ),” http://crypto.stanford.edu/~dabo/, 2001.
- 4.B. Chor, A. Fiat, and M. Naor, “Tracing traitors,” Proceedings of CRYPTO’ 94, LNCS 839, Springer Verlag, pages 257–270, 1994.Google Scholar
- 6.K. Kurosawa and Y. Desmedt, “Optimum traitor tracing and asymmetric schemes with arbiter,” Proceedings of EUROCRYPT’ 98, LNCS 1403, Springer Verlag, pp.145–157, 1999.Google Scholar
- 7.M. Naor and O. Reingold, “Number theoretic constructions of efficient pseudorandom functions,” Proceedings of 38th IEEE Symposium on Foundations of Computer Science, pp.458–467, 1997.Google Scholar
- 8.M. Stadler, “Publicly verifiable secret sharing,” Proceedings of EUROCRYPT’ 96, LNCS 1070, Springer Verlag, pp.190–199, 1996.Google Scholar
- 10.D. Stinson and R. Wei, “Key preassigned traceability schemes for broadcast encryption,” Proceedings of SAC’98, LNCS 1556, Springer Verlag, pp.144–156, 1998.Google Scholar