Fully Collusion-Resilient Traitor Tracing Scheme
msra
摘要
At Eurocrypt 2006, Boneh et al. (1) presented a fully collusion-resistant traitor tracing scheme. Their scheme is based on composite order bilinear groups, and its security depends on the hardness of the subgroup decision assumption. In this paper we present a new scheme which is based on prime order bilinear groups, and its security depends on the hardness of the decisional linear assumption. Because of this, for the same level of security, our scheme allows for better eciency (depending on the parameters). For example, if encryption time was the major parameter of concern, then for the same level of security our scheme could encrypt approximately 18 times faster. Also, unlike the Boneh et al. scheme, our scheme does not require a trusted tracing party. This paper provides general guidelines for transforming a scheme based on composite order bi- linear groups to one based on prime order bilinear groups.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络