检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学综合业务网国家重点实验室,陕西西安710071
出 处:《西安电子科技大学学报》2003年第3期394-398,共5页Journal of Xidian University
基 金:国家自然科学基金资助项目(69972034);重点实验室基金资助项目(51436060301DZ0103)
摘 要:Domingo曾提出了一种不需要注册机构帮助就能鉴别出盗版者匿名数字指纹方案,但该方案在鉴别盗版者时平均需要N/2次指数运算(N为公开钥字典中公开钥的总数).ChanjooChung给出了改进Domingo方案,但在其注册协议中存在一个安全漏洞,即任意的假冒者能成功地冒充一名诚实用户的概率为1/2.针对这一情况给出了一种较Domingo方案更高效的匿名数字指纹方案,使得在鉴别盗版者时仅需1次指数运算,大大地提高了整个方案效率,且安全性与Domingo方案相当,同时也解决了ChanjooChung方案的安全漏洞.The first anonymous digital fingerprinting scheme was presented by Domingo in Electronic Letter, in which the redistributors are identified without the help of registration institution. However, Domingos scheme requires averagely N/2 exponential operations (N: the number of public keys in the directory) in order to identify redistributors. Chanjoo Chung gave an improved Domingos scheme in PKC2000. But there is a security weakness in his registration protocol, namely, any impersonator can successfully personate an honest buyer with the probability 1/2. In our paper, a more efficient anonymous digital fingerprinting scheme than the scheme by Domingo is given. This scheme requires only 1 exponential operation for identifying redistributors, which improves the whole schemes efficiency. At the same time, our schemes security is the same as that of Domingos scheme. In addition, the security weakness of Chanjoo Chungs scheme is overcome in our scheme.
关 键 词:数字指纹 数字水印 安全双方计算 匿名 指数运算 版权保护
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.190