Anonymous Fingerprinting as Secure as the Bilinear Diffie-Hellman Assumption
Anonymous Fingerprinting as Secure as the Bilinear Diffie-Hellman Assumption
复制标题
匿名指纹识别与双线性 Diffie-Hellman 假设一样安全
DOI：
10.1007/3-540-36159-6_9
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Kwangjo Kim
中科院分区：
文献类型：
--
作者：
Myungsun Kim;Jongseong Kim;Kwangjo Kim
数字存储信息的非法复制和再分发是以电子方式销售数字数据的分销商面临的一个关键问题。指纹识别提供了一种手段，版权所有者可以跟踪非法再分发的电子信息。作为版权保护的技术，已经出现了各种指纹方案，包括Boneh和Shaw的对称指纹[3]，Pfitzmann和Schunter的非对称指纹[14]以及Pfitzmann和Waidner的匿名指纹[15]。在以前的大多数方案中，客户端的计算能力被假定为彼此大致相等，甚至与它们的服务器大致相等。特别是，指纹识别方案的已知算法的密钥大小阻碍了其实际实现。本文提出了一个基于双线性Diffie-Hellman问题的匿名指纹方案，并证明了其安全性。我们的方案表现出所有的计算比以前的方案更有效地执行和密钥大小是相当合理的实际使用。
The illegal copying and redistribution of digitally-stored information is a crucial problem to distributors who electronically sell digital data. Fingerprinting provides a means which a copyright owner can trace illegal redistributors of electronic information. Various fingerprinting schemes have appeared as techniques for copyright protection from symmetric fingerprinting by Boneh and Shaw [3], asymmetric fingerprinting by Pfitzmann and Schunter [14], and anonymous fingerprinting by Pfitzmann and Waidner [15]. In most of previous schemes, the computational capability of clients has been assumed to roughly be equal to each other and even to their servers. In particular, the key size of known algorithms for fingerprinting schemes keeps back from their practical implementation. In this paper, we propose a scheme for anonymous fingerprinting based on the bilinear Diffie-Hellman problem and prove its security. Our scheme exhibits all computations are performed more efficiently than previous schemes and the key size is quite reasonable for practical use.