We address the problem of watermarking graph objects, which consists in hiding information within them, to prove their origin. The two existing methods to watermark graphs use subgraph matching or graph isomorphism techniques, which are known to be intractable for large graphs. To reduce the operational complexity, we propose FFG, a new graph watermarking scheme adapted from an image watermarking scheme, since graphs and images can be represented as matrices. We analyze and compare FFG, whose novelty lies in embedding the watermark in the Fourier transform of the adjacency matrix of a graph. Our technique enjoys a much lower complexity than that of related works (i.e. in O(N2logN)), while performing better or at least as well as the two state-of-the-art methods.
@article{arxiv.2502.04182,
title = {Fast In-Spectrum Graph Watermarks},
author = {Jade Garcia Bourrée and Anne-Marie Kermarrec and Erwan Le Merrer and Othmane Safsafi},
journal= {arXiv preprint arXiv:2502.04182},
year = {2025}
}