A blind, fast and robust method for geographical data watermarking

Authors:
Cyril Bazin;Jean-Marie Le Bars;Jacques Madelaine
Affiliations:
University of Caen, Caen, France;University of Caen, Caen, France;University of Caen, Caen, France
Venue:
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Year:
2007

Citing 6
Cited 3

Techniques for data hiding

IBM Systems Journal
Digital watermarking

Digital watermarking
Query-preserving watermarking of relational databases and XML documents

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Watermarking 3D polygonal meshes in the mesh spectral domain

GRIN'01 No description on Graphics interface 2001
Watermarking 2D Vector Maps in the Mesh-Spectral Domain

SMI '03 Proceedings of the Shape Modeling International 2003
Watermarking relational databases

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

A Novel Framework for Watermarking: The Data-Abstracted Approach

IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Blind and squaring-resistant watermarking of vectorial building layers

Geoinformatica
Watermarking geographical data on spatial topological relations

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to propose an efficient digital water-marking algorithm on geographical data. Our algorithm is fast, blind and robust. Thus, the original data is not needed in order to prove the authorship of the document and the watermark is resiliant against many transformations applied on the document. The method we propose is based on a modification of parts of the data selected upon local criterias and a secret key. The local criterias use topological properties of a Delaunay mesh build on the original map. The local modifications of parts of the document introduce a statistical slant inside the document. The detection algorithm is a simple detection of this slant. Experimental results illustrate the resiliance of the algorithm against different tranformations such as rotation, translation, data shuffling and cropping.