Metraipolis › archive › dc_09ab99c35b2b
Bit-Level Triangular Content-Aware Permutation for Fragile Image Watermarking: Zero False Positive Rate, Single-Bit Sensitivity, and Arbitrary Dimension Support — arXiv:2608.14800
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.14800
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T19:33:49.842Z
- SHA-256 of the archived text
a33a77779491f472b66e15f81d4bb7939e4c6a85abc1285f6129934b222f04c7- Stable URL of this page
https://metraipolis.com/documento/dc_09ab99c35b2b
How to cite
Bit-Level Triangular Content-Aware Permutation for Fragile Image Watermarking: Zero False Positive Rate, Single-Bit Sensitivity, and Arbitrary Dimension Support — arXiv:2608.14800 — arXiv (en), https://arxiv.org/abs/2608.14800 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_09ab99c35b2b (Metraipolis archive dc_09ab99c35b2b, sha256 a33a77779491f472b66e15f81d4bb7939e4c6a85abc1285f6129934b222f04c7)
BibTeX
@misc{dc09ab99c35b2b,
title = {Bit-Level Triangular Content-Aware Permutation for Fragile Image Watermarking: Zero False Positive Rate, Single-Bit Sensitivity, and Arbitrary Dimension Support — arXiv:2608.14800},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.14800},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_09ab99c35b2b; sha256 a33a77779491f472b66e15f81d4bb7939e4c6a85abc1285f6129934b222f04c7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14800. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
With the growth of digital document exchange, protecting image integrity against attacks such as Vector Quantization (VQ) and collage has become critical. Existing methods are vulnerable to these attacks and limited to fixed image dimensions. This paper presents a novel, dimension-agnostic, fragile watermarking algorithm that enhances security and tamper localization by replacing conventional hash functions with Triangular Content-Aware Permutation (TCA). The image is combined with key-based global noise and divided into blocks. The core innovation is applying content-dependent permutation with intrinsic avalanche effect (TCA) at the bit-plane level, generating a unique content-dependent watermark. For color images, a vertical sandwich transformation merges channels, preserving inter-channel dependency with only 1.62x time increase. The "remainder merging" strategy eliminates padding constraints. Experiments on 50 grayscale and 10 color images under 18 attacks show FPR=0% and FNR=0% for 17 attacks. Salt-and-pepper noise yields negligible FNR of 0.27% (grayscale) and 0.14% (color). Average PSNR is 51.14 dB (8-bit), 75.25 dB (12-bit), and 99.33 dB (16-bit). Embedding and extraction times are 1.61 s and 1.63 s, respectively. The algorithm achieves 100% accuracy against collage, VQ, copy-move, JPEG (quality 5-95), and geometric attacks, providing a secure solution for digital forensics, medical imaging, and legal document authentication. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-18 in cs.CR). Categorie arXiv: Cryptography and Security (cs.CR) ; Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2608.14800 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T19:01:59.104Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).