Defending against Additive Attacks with Maximal Errors in Watermarking Relational Databases

• Main Authors: LI, Yingjiu, Swarup, Vipin, Jajodia, Sushil
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2004
• Subjects: Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/580; http://dx.doi.org/10.1007/1-4020-8128-6_6
• Institution: Singapore Management University

Recently, several database watermarking techniques have been developed to fight against database piracy. In watermarking, a database owner’s identification information is embedded into a database such that proof of ownership can be established by detecting the information in pirated data. However, most watermarking systems are vulnerable to the severe threat of additive attacks and this threat has not been studied formally. In an additive attack, a pirate inserts an additional watermark such that the proof of ownership becomes ambiguous. In this paper, we present an effective approach to defending against additive attacks. Our strategy is to raise the errors introduced during watermark insertion to a predetermined threshold such that any additive attack would introduce more errors than the threshold. Exceeding the error threshold means that the pirated data is less useful or less competitive; thus, the owner does not need to claim ownership for such pirated data.