Counterfeiting attacks on oblivious block-wise independent invisible watermarking schemes
By Matthew J. Holliman, Nasir D. Memon. IEEE Transactions on Image Processing, 2000
463 citations recorded by the source corpus.
Subfields: Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/62ec8924653c57b567d70b2cd807ea8e71a220c7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Gaurav Sharma
- A. Tekalp
- Mehmet Utku Celik
- Min Wu
- Ping Wah Wong
- Chung-Kai Hsieh
- Po-Whei Huang
- Phen-Lan Lin
Citations in the corpus
- Hierarchical watermarking for secure image authentication with localization (2002, methodology): “B. Vector Quantization Counterfeiting Attack Holliman and Memon [14] proposed a counterfeiting attack on blockwise independent watermarking schemes.”
- The First 50 Years of Electronic Watermarking (2002, unknown): “proposed [34, 36].”
- Lossless watermarking for image authentication: a new framework and an implementation (2006, background): “Note that none of the lossless authentication methods in the literature offer tamper localization capability, which is one of the major advantages of authentication watermarks over conventional digital signatures.”
- A hierarchical digital watermarking method for image tamper detection and recovery (2005, methodology): “However, Holliman and Memon[25] soon presented a vector quantization (VQ) counterfeiting attack that can construct a counterfeit image from a VQ codebook generated from a set of watermarked images.”
- Data hiding in binary image for authentication and annotation (2004, background): “Envisioning potential malicious attacks such as those studied in [ 20 ], it is important to study the following two problems for authentication applications, assuming that the attacker has no knowledge about any secret keys: 1) the probability of making content alterations while preserving the -bit ”
- Data-Hiding Codes (2005, background): “The figure shows representative points for the best known codes [256,128,38], [256,64,62], [256,32,96], [256,16,113], [256,8,128], [256,4,136], [256,2,170], [256,1,256].”
- Secret and public key image watermarking schemes for image authentication and ownership verification (2001, methodology): “The two parameters and are very important for the scheme to resist the “vector quantization” attack proposed by Holliman and Memon [15].”