Defending against Additive Attacks with Maximal Errors in Watermarking Relational Databases

Publication Type

Conference Proceeding Article

Publication Date

7-2004

Abstract

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.

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

Research Directions in Data and Applications Security XVIII: IFIP TC11/WG11.3 Eighteenth Annual Conference on Data and Applications Security July 25–28, 2004, Sitges, Catalonia, Spain

Volume

144

First Page

81

Last Page

94

ISBN

9781402081286

Identifier

10.1007/1-4020-8128-6_6

Publisher

Springer Verlag

City or Country

Sitges, Catalonia, Spain

Comments

Research Directions in Data and Applications Security XVIII, Pages 81-94, Kluwer Academic Publishers, 2004

Additional URL

http://dx.doi.org/10.1007/1-4020-8128-6_6

Link to Full Text

Share

COinS