Searcharxiv⌕ Search

arXiv · 2611.08985

NotaryMark: Multi-Bit Watermarking for Black-Box DatasetUsage Auditing in Text-to-Image Diffusion Models

Abstract

As generative artificial intelligence (AI) models increasingly require data, more publicly available yet licensed data is being harvested and used without authorization. Although several previous studies have proposed watermarking methods for dataset copyright auditing, their applicability to the text-to-image (T2I) setting remains notably limited. The core drawback is that watermarks embedded by existing techniques are often treated as noise and are gradually filtered out and attenuated during the latent noising-denoising process of diffusion model training. We propose NotaryMark, to our knowledge the first multi-bit watermarking method specifically designed for black-box auditing of T2I training dataset use. The core idea of NotaryMark is to align the watermark with the latent denoising of diffusion models, thereby overcoming the signal decay that plagues existing multi-bit methods during sampling. We evaluate NotaryMark across three datasets and three diffusion models spanning watermark capacities from 8 to 1024 bits. With a watermark capacity below 32 bits, it achieves a high average bit accuracy of 0.85-0.90. With a watermark capacity exceeding 32 bits, it maintains bit accuracy between 0.67 and 0.80, consistently outperforming existing multi-bit watermark methods whose bit accuracy is around 0.42-0.60. Furthermore, we design a voting-based aggregation scheme to boost the bit accuracy with a modest budget of 30 queries. Building on this, we incorporate error-correcting codes to enable reliable decoding and tracing of the embedded identifier information. Robustness evaluation against fifteen evasion attacks spanning seven categories shows that NotaryMark remains robust under most evaluated settings, while stronger attacks generally suppress watermark evidence only at the cost of substantial utility degradation, demonstrating its practical reliability against malicious tampering.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinyi Yu, Linkang Du, Zhou Su, Min Chen, Yuntao Wang, Zhikun Zhang. 2026-11-06. NotaryMark: Multi-Bit Watermarking for Black-Box DatasetUsage Auditing in Text-to-Image Diffusion Models. https://arxiv.org/abs/2611.08985

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Backdoor Channels Hidden in Latent Space: Extending Cryptographic Undetectability to Modern Neural Networks

Recent cryptographic results establish that neural networks can be backdoored such that no efficient algorithm can distinguish them from a clean model. These guarantees, however, have been confined to stylised architectures of limited practical relevance, leaving open whether comparable undetectability extends to modern, end-to-end trained networks. We construct such an attack mechanism for deep neural network architectures, closely aligned to the cryptographic notion of undetectability, by identifying backdoor channels as learned latent directions, and show that the question of undetectability reduces to a hypothesis test between two unknown distributions over model parameters, which we conjecture to be intractable in practice. The consequence of this reframing is significant: if exploitable channels within a network's latent space are statistically indistinguishable from naturally learned directions, an attacker need not introduce foreign structure but can instead exploit the geometry the network already possesses. Demonstrating the approach on ResNet and Vision Transformer architectures trained on standard image classification datasets, the attack achieves both consistently high success rates with negligible clean accuracy degradation, and resists a comprehensive suite of post-training defences, none of which neutralise the backdoor without rendering the model unusable. Our results establish that cryptographic backdoors need not be artefacts requiring exotic architectures or artificial constructions, but identifiable as latent properties inherent to the geometry of learned representations.

cs.CR↗

Erase the Mark, Preserve the Motion: Temporally Consistent Removal of Video Watermarks

Recent advances in video generation have increased the demand for reliable watermarking for copyright protection, yet the robustness of video watermarks against removal attacks remains underexplored. Most watermark-removal methods originate from the image domain: signal optimization injects imperceptible pixel-domain perturbations, whereas generative resynthesis produces a visually similar instance through diffusion synthesis. When extended to videos, the former introduces temporally varying noise that causes visible flickering, while the latter regenerates fine-grained structures inconsistently across frames, leading to structural motion inconsistency. To evaluate video watermark robustness, we propose PoseRegen, a pose-consistent reconstruction framework that removes watermarks while preserving the original content and motion. PoseRegen first applies a temporally shared viewpoint transformation to disrupt watermark-bearing spatial patterns and then jointly reconstructs the transformed sequence with a pose-conditioned video model. A frozen video DiT processes the complete sequence with its reference-video latent, and full-sequence Flow Matching supervision keeps identity and background consistent across frames. To further preserve motion structure, we introduce a lightweight Pose-Conditioned Motion Consistency Adapter that adapts the frozen backbone to temporally ordered pose guidance and constrains body-part trajectories throughout reconstruction. Experiments on eleven video watermarking schemes show that PoseRegen reduces the average bit accuracy to 0.505, near random guessing, while outperforming the strongest baseline by 9.34% on motion-related VBench metrics. These results reveal a practical vulnerability of current video watermarks and highlight the need to evaluate robustness jointly with temporal and motion quality.

cs.CR↗

Differential privacy with adjustable preservation of multivariate relationships

This paper derives an exact attenuation formula for multivariate cross-moments under differential privacy achieved through randomized response. From a proposed alternative formulation of randomization matrices compliant with differential privacy guarantees we show that, under attribute-level randomization and where the randomization of the whole distribution is characterized by Kronecker products, any cross-moment of the anonymized dataset involving distinct attributes is equal to the original cross-moment multiplied by attenuation parameters, themselves determined by the part of the overall privacy budget allocated to each attribute. This characterization enables explicit and transparent controls of multivariate relationships preservations in differential privacy through privacy budget allocation. A simple numerical illustration demonstrates that identical total budgets can yield substantially different covariance-preservation profiles. The results also make the multiplicative loss of higher-order interactions explicit and thus can support mechanism design guided by analytical priorities.

cs.CR↗