一种改进的关系数据数字水印算法  

Improved algorithm for relational data watermarking

作　　者：包希日莫[1] 张璟[1] 李军怀[1] 张杰[1] 

机构地区：[1]西安理工大学计算机科学与工程学院,陕西西安710048

出　　处：《计算机应用》2005年第12期2759-2763,共5页journal of Computer Applications

摘　　要：介绍了Agrawal算法,针对其容易破坏数据的使用价值和具有属性顺序敏感性等不足之处,提出了引入百分比约束和按属性名的散列值对属性进行排序的改进策略,并给出了改进算法。仿真试验证明,改进后的算法能够更有效地保护数据的使用价值,摆脱了属性顺序攻击的威胁,实现了完全的盲检测,并且更加实用。Agrawal algorithm was introduced, which was easy to destroy data usability and sensitive to attributes ordering, an improved algorithm based on the improvement strategies of introducing percentage constraint and sorting attributes according to their cryptographic keyed hash values was presented. Deployments of the original and improved algorithm on real-life data show that the improved algorithm is able to preserve data usability more effectively, robust against attributes reordering attack, and it is a complete blind and more practical system .

关 键 词：关系数据 数字水印 算法 版权保护 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]