#### DMCA

## Collusion-Resistant Fingerprinting for Multimedia (2004)

### Cached

### Download Links

- [www.winlab.rutgers.edu]
- [www.ece.ubc.ca]
- [sig.umd.edu]
- [www.winlab.rutgers.edu]
- [www.ece.umd.edu]
- [www.ece.umd.edu]
- [www.ece.umd.edu]
- [www.ece.umd.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 26 - 2 self |

### Citations

10437 | Introduction To Algorithms - Cormen, Leiserson, et al. - 1991 |

1072 | Secure spread spectrum watermarking for multimedia
- Cox, Kilian, et al.
- 1997
(Show Context)
Citation Context ...gital fingerprinting is used to trace the consumers who use their content for unintended purposes. These fingerprints can be embedded in multimedia content through a variety of watermarking techniques=-=[1, 2]-=-. Conventional watermarking techniques are concerned with robustness against a variety of attacks such as filtering, but do not emphasize robustness against a coalition of users with the same content ... |

490 | Quantization index modulation: A class of provably good methods for digital watermarking and information embedding - Chen, Wornell - 2001 |

352 | Fundamentals of Statistical signal processing, Volume 2: Detection theory - Kay - 1998 |

347 | Collusion-secure fingerprinting for digital data - Boneh, Shaw - 1998 |

261 | Information-Theoretic Analysis of Information Hiding - Moulin, O'Sullivan - 2003 |

104 | Anti-collusion fingerprinting for multimedia - Trappe, Wu, et al. - 2003 |

76 |
Image adaptive watermarking using visual models
- Podilchuk, Zeng
- 1998
(Show Context)
Citation Context ...gital fingerprinting is used to trace the consumers who use their content for unintended purposes. These fingerprints can be embedded in multimedia content through a variety of watermarking techniques=-=[1, 2]-=-. Conventional watermarking techniques are concerned with robustness against a variety of attacks such as filtering, but do not emphasize robustness against a coalition of users with the same content ... |

69 | Multiresolution scene-based video watermarking using perceptual models - Swanson, Zhu, et al. - 1998 |

52 |
Analysis of attacks on image watermarks with randomized coefficients
- Stone
- 1996
(Show Context)
Citation Context ... attacks, can provide a cost-effective approach to removing an identifying watermark. One of the simplest approaches to perform a collusion attack is to average multiple copies of the content together=-=[3]-=-. Other collusion attacks might involve forming a new content by selecting different pixels or blocks from the different colluders’ content. The authors may be contacted at wxt, minwu, and kjrliu @eng... |

52 | Multimedia Data Hiding - Wu, Liu - 2002 |

52 | A statistical watermark detection technique without using original images for resolving rightful ownerships of digital images
- Zeng, Liu
- 1999
(Show Context)
Citation Context ...marking scheme similar to that in[2], where the perceptually weighted watermark was added to block DCT coefficients. The detection of the watermark is performed without the knowledge of the host image=-=[8]-=- via the Z detection statistic[3]. We used the 512×512 Lenna as the host image for the fingerprints. The fingerprinted images had no visible artifacts with average PSNR of 39.6dB. We assigned the code... |

46 | A note on the limits of collusionresistant watermarks - Ergun, Kilian, et al. - 1999 |

45 | translation resilient public watermarking for images - Lin, Wu, et al. - 2000 |

40 | Combining digital watermarks and collusion secure fingerprints for digital images
- Dittmann, Schmitt, et al.
- 2000
(Show Context)
Citation Context ...hile those bits that differ do. We use this observation to design a family of bit sequences {c j } whose overlap with each other can identify groups of colluding users. A similar idea was proposed in =-=[5]-=-, where projective geometry was used to construct such code sequences. As we will explain in this section, the codes constructed in [5] were less efficient than the proposed. For this section, we shal... |

38 | Design theory
- Lindner, Rodger
- 1997
(Show Context)
Citation Context ...e known to exist if and only if v ≡ 1 or 3 (mod 6). The Bose construction builds Steiner triple systems when v ≡ 3 (mod 6), and the Skolem construction builds Steiner triple systems when v ≡ 1 (mod 6)=-=[7]-=-. Additionally, (p d ,p,1)-BIBD can be constructed when p is of prime power[6]. 4. SUBGROUP-BASED CONSTRUCTIONS In this section, we present an approach that decreases the computation requirements need... |

36 | Secure copyright protection techniques for digital images - Herrigel, Ruanaidh, et al. - 1998 |

29 | Group-oriented fingerprinting for multimedia forensics - Wang, Wu, et al. - 2008 |

28 |
Contemporary Design Theory: A Collection of Surveys
- Dinitz, Stinson
- 1992
(Show Context)
Citation Context ... do this, we need to give up some resiliency. We now present a construction of a k-resilient ACC code that, for n users, requires O( √ n) bits. This construction uses balanced incomplete block designs=-=[6]-=-: Definition 2. A (v, k, λ) balanced incomplete block design (BIBD) is a pair (X , A), where A is a collection of k-element subsets (blocks) of a v-element set X , such that each pair of elements of X... |

27 | Resistance of digital watermarks to collusive attacks - Kilian, Leighton, et al. - 1998 |

26 | Capacity of digital watermarks subjected to an optimal collusion attack - Su, Eggers, et al. - 2000 |

25 | Improved Boneh-Shaw content fingerprinting - Yacobi - 2001 |

21 | Data hiding in image and video: Part I-Fundamental issues and solutions - Wu, Liu |

20 | Eds., The Handbook of Combinatorial Designs. Boca - Colbourn, Dinitz - 1996 |

18 | H.: Robust, content-dependent, high-fidelity watermark for tracking in digital cinema - Lubin, Bloom, et al. - 2003 |

18 | pattern matching attack on watermarking systems - Kirovski, Petitcolas, et al. - 2002 |

13 | A Content-Dependent Spatially Localized Video Watermark for Resistance to Collusion and Interpolation Attacks - Su, Kundur, et al. - 2001 |

12 | Multimedia content screening using a dual watermarking and fingerprinting system - Kirovski, Malvar, et al. - 2004 |

11 | Nonlinear collusion attacks on independent fingerprints for multimedia - Zhao, Wu, et al. |

11 | Resistance of orthogonal gaussian fingerprints to collusion attacks - Wang, Wu, et al. - 2003 |

11 | Modifications of competitive group testing - Du, Xue, et al. - 1994 |

8 | Modulation and multiplexing techniques for multimedia data hiding
- Wu, Liu
- 2001
(Show Context)
Citation Context ...ist of all n-bit binary vectors that have only a single 0 bit. For example, separated by √ 2E, whereas CDMA requires √correlating with B waveforms and has constellation points separated by 2 E/B. See =-=[4]-=-. when n =4, C = {1110, 1101, 1011, 0111}. It is easy to see when k ≤ n − 1 of these vectors are combined under AND, that this combination is unique. This code has cardinality n, and hence can produce... |