Watermarking relational data: framework, algorithms and analysis
Watermarking relational data: framework, algorithms and analysis
复制标题
DOI：
10.1007/s00778-003-0097-x
复制
发表时间：
2003-08-01
期刊：
影响因子：
4.2
通讯作者：
Kiernan, J
中科院分区：
文献类型：
--
作者：
Agrawal, R;Haas, PJ;Kiernan, J
我们阐明需要水印数据库的关系，以阻止数据盗版，识别关系数据的特点，水印带来独特的挑战，并描绘理想的属性的水印系统的关系数据。然后，我们提出了一个有效的水印技术面向关系数据。此技术确保某些元组的某些属性的某些位位置包含特定值。具体的位位置和值是在只有数据所有者知道的秘密密钥的控制下通过算法确定的。该位模式构成水印。只有当一个人可以访问的秘密密钥可以检测水印以高概率。检测水印既不需要访问原始数据也不需要访问水印，并且在存在插入、更新和删除的情况下可以容易且有效地维护水印。我们的分析表明，所提出的技术是强大的，对各种形式的恶意攻击，以及良性的数据更新。使用DB2上运行的实现，我们还表明，该算法的性能足够好，可以在现实世界中使用的应用程序。
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and delineate desirable properties of a watermarking system for relational data. We then present an effective watermarking technique geared for relational data. This technique ensures that some bit positions of some of the attributes of some of the tuples contain specific values. The specific bit locations and values are algorithmically determined under the control of a secret key known only to the owner of the data. This bit pattern constitutes the watermark. Only if one has access to the secret key can the watermark be detected with high probability. Detecting the watermark requires access neither to the original data nor the watermark, and the watermark can be easily and efficiently maintained in the presence of insertions, updates, and deletions. Our analysis shows that the proposed technique is robust against various forms of malicious attacks as well as benign updates to the data. Using an implementation running on DB2, we also show that the algorithms perform well enough to be used in real-world applications.