期刊文献+

一种用户受限的数字指纹编码方法

User-limited digital fingerprint code scheme
原文传递
导出
摘要 针对用户数量受限的应用环境,给出一种以一系列小的BIBD(balanced incomplete block design)关联矩阵取补转置得到的编码矩阵,替代单位标准正交阵中的非零元素构成2层的级联码,与混沌序列异或,并根据合谋假设计算并重复码字后分配给分组用户的数字指纹方案.基于该方案,研究了分组编码的区块矩阵的大小对编码抗合谋攻击的影响,讨论了用户分组的合理性原则.实验表明:选取大小相近的内码矩阵块并设置相对均衡的用户分组,对提高指纹编码的抗合谋攻击能力和编码效率有着积极的作用. To study the applied environment with limited quantity of users, a serial small transposed matrixes of balanced incomplete block design was used in the digital fingerprint code method for limit ed users to replace the nonzero elements of unit matrix. A two-level code was built, and duplicates a few times based on the situation of collusion attacks and distributes to users was duplicated. Based on the scheme, the influence on the ability of anti-collusion attack brought from the size of block matrix was studied, and the principle of grouping users was analyzed. Research shows that it is helpful to im- prove the anti-collusion ability of the codeword and efficiency of encoding by choosing similar size block matrix and setting balanced usersr groups.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第10期5-8,共4页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家高技术研究发展计划资助项目(2007AA01Z309) 中央高校基本科研业务费专项资金资助项目(2012-IV-058)
关键词 数据安全 图像处理 数字水印 数字指纹 泄密者追踪 分组方案 security of data image processing digital watermarking digital fingerprint trace trai- tor grouping method
  • 相关文献

参考文献15

  • 1Barni M, Bartolini F, Furon T. A general framework for robust watermarking security[J]. Signal Process- ing, 2003, 83(10): 2069-2084.
  • 2Chor B, Fiat A, Moninaor. Tracing traitors[C]// Proceedings o[ International Cryptologyr 94. Berlin: Springer-Verlag, 1994: 257-262.
  • 3Domingo-Ferrer J, Herrera-Joancomarti J. A simple collusion-secure fingerprinting schemes for images [C]//Proceedings of the International Symposium on Information Technology: Coding and Computing. New York: IEEE, 2000: 128-132.
  • 4Pfitzmann B. Trials of traced traitors[C]//The First International Workshop, Information Hiding 96. Berlin: Springer-Verlag, 1996: 49-64.
  • 5Schaathun H G, Fernandez M. Boneh-shaw finger- printing and soft decision decoding[C] // Proceedings of 2005 IEEE Information Theory Workshop. New York:IEEE, 2006= 183-186.
  • 6Nuidal K, Fujitsu S, Hagiwara M, et al. An improvement of tardos's collusion-secure fingerprinting codes with very short lengths [C]//Proceedings of Appl Algebra Eng Commun Comput. Berlin: Springer-Verlag, 2007:80-89.
  • 7Safavi-Naini R, Wang Y. Collusion secure q-ary fin- gerprinting for perceptual content [C] // Proceedings of ACM Workshop on Security and Privacy in Digital Rights Management. Berlin: Springer Verlag, 2002: 57-75.
  • 8Schaathun H G. The boneh-shaw fingerprinting scheme is better than we thought[J]. IEEE Transactions on Information Forensics and Security, 2006, 1 (2) : 248-255.
  • 9Muratani H. A collusion-secure fingerprinting code reduced by Chinese remaindering and its random-error resilience[C]// Proceedings of Information Hiding 2001, Berlin: Springer-Verlag, 2001:303-315.
  • 10Trappe, Wu M, Liu K J R. Collusion-resistant fingerprinting for muttimedia[C]//IEEE International Conferences on Acoustics, Speech, and Signal Proeessing'02. New York: IEEE, 2002, 4: 3309- 3312.

二级参考文献1

  • 1An Ping LIAO,Zhong Zhi BAI Department of Mathematics. Hunan University. Changshu, 410082. P. R. China Department of Mathematics and Information Science, Changsha University, Changsha 410003. P. R. China Academy of Mathematics and System. Sciences. Chinese Academy of Sciences. Beijing 100080. P. R. China State Key Laboratory of Scientific/Engineering Computing. Chinese Academy of Sciences. Institute of Computational Mathematics and Scientific/Engineering Computing. Academy of Mathematics and System Sciences. Chinese Academy of Sciences. P. O. Box 2719. Beijing 100080. P. R. China.The Constrained Solutions of Two Matrix Equations[J].Acta Mathematica Sinica,English Series,2002,18(4):671-678. 被引量:43

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部