Robust hash functions for digital watermarking

By J. Fridrich. Proceedings of the International Conference on Information Technology, 2000

386 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Robust and secure image hashing (2006, methodology): “A solution to this problem is to use secure, content-dependent hash values as a key to generate the watermark [13].”
Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs (2006, background): “The underlying techniques for constructing image hashes can roughly be classified into methods based on image statistics [3], [4] [5], relations [6], [7], preservation of coarse image representation [8], [9], [10], and low-level image feature extraction [11], [12].”
Implementation and Benchmarking of Perceptual Image Hash Functions (2010, neutral): “[15] proposes such semi-fragile signatures.”
PhotoProof: Cryptographic Image Authentication for Any Set of Permissible Transformations (2016, neutral): “, [46], [20], [55], [33], [48], [17], [59], [34], [60]).”
Robust and Secure Image Hashing via Non-Negative Matrix Factorizations (2007, methodology): “Fridrich and Goljan [13] propose a robust hash based on preserving selected (low-frequency) DCT coefficients.”