I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190  Home/Search   Document Details and Download   Summary   Related Articles   Check

....received December 1, 2002; revised December 2, 2002. The authors are with Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA. E ml: darkok, malvar microsoft. corn techniques explore the fact that the HAS is insensitive to small amplitude changes, either in the time [4] or frequency [5], 6] 7] domains, as well as insertion of low amplitude timedomain echoes [8] Information modulation is usually carried out using: SS [9] or quantization index modulation (QIM) 10] The main advantage of both SS and QIM is that WM detection does not require the original recording, and that it ....

....vector, where the elements :ci are independent identically distributed (i.i.d. Gaussian random variables, with standard deviation o a: i.e. ci iV(O, o a: Because :c actually represents a collection of blocks of samples from an appropriate invertible transformation on the original audio signal [5], 7] 9] such modeling is arguable and is further discussed in Section V. A watermark is defined as a direct SS sequence w, which is a vector pseudo randomly generated in w C 1 N. Each element w is usually called a chip. WM chips are generated such that they are mutually independent with ....

I.J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Proc. Inform. Hiding Workshop, Cambridge, England, June 1996, pp. 147 158.

....In this paper, we explore the challenges of the BPM attack and show how it can be launched on audio content. II. GENERIC BPM ATTACK The BPM attack is not limited to a type of content or to a particular watermarking algorithm. For example, systems that modulate secrets using spread spectrum [12] and or quantization index modulation (QIM) 13] are all prone to the BPM attack. In order to launch the attack successfully, the adversary does not need to know the details of the watermark codec. The adversary needs to reduce the granularity of integral blocks of data such that no block contains ....

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia." In Anderson [16], pp. 183 206, ISBN 3- 540-61996-8.

....information that does not affect directly the image content as perceived by the observer. Consequently, modifications of this information will not be perceived by the casual observer. Two basic directions have been followed: a) modification of cover data in the frequency domain (see, for example [5]) and (b) modification of cover data in the spatial domain [2, 4, 6] Further references are given in Katzenbeisser et al. 1] and in Voyatzis et al. 8] Most watermarking techniques applied in the spatial domain are based on the properties of the Human Visual System (HVS) Kutter et al. 4] ....

I.J. Cox, J. Kilian, T. Leighton and T. Shamoon, "A Secure, Robust Watermark for Multimedia," Workshop on Information Hiding, Newton Institute, Univ. of Cambridge, May 1996.

....unknown content can be identified, even if it is modified within an acceptable range of degradation (e.g. by compression or AD DA conversion) As described above, a robust hash function is a means for identifying multimedia content. In this sense it has similarities with watermarking technology [5][6] which is commonly used for the same purpose. There is however also a distinguishing difference. Whereas watermarking requires modification of original content (viz. watermark embedding) before it can be released (with potential impact on content quality and logistical problems) robust ....

I. Cox, J. Kilian, F.T. Leighton and T. Shamoon, "A secure robust watermark for multimedia", In Proc. of the Information Hiding Workshop, pp. 175-190, Cambridge U.K., May 1996.

....subsets, and use of redundancy and search. For watermark detection, our schemes do not require the original image or any information about it. 1. INTRODUCTION During the past several years, a variety of image watermarking schemes have been introduced in literature and applied in practice [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]. Such schemes hide a small amount of data, typically one to 1K bits, in images for purposes such as copyright protection and image identification. Unfortunately, virtually all published watermarking schemes fail to withstand attacks aimed at rendering embedded data unreadable, and most watermarks ....

....which we describe later. The first two methods below aim against both current and potential new attacks, while our image enhancement procedure can be seen as putting an attacked image in canonical form before testing. 1. Embedding in a specially chosen domain: As has been done in the literature [1], we insert watermark data into the DCT or wavelet transform of an entire image, and we choose a random subset of coefficients with the highest power in a transform region that omits both the lowest and highest frequencies. This region comprises about 10 of the entire DCT, and was experimentally ....

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Workshop on Information Hiding, Univ. of Cambridge, England, May 1996.

....signal . The simplest of such methods have purely additive embedding functions of the form (2) where is typically a pseudo noise sequence. Such embedding methods are often referred to as additive spread spectrum methods, and some of the earliest examples are described in [24] 25] 10] 26] [11], 12] Typically, takes the form (3) where is a unit energy spreading vector and is a scalar function of the message. 3 It is often convenient to view additive spread spectrum as perturbation of a projection. In particular, substituting (3) into (2) and using that has unit energy, we obtain ....

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information Hiding. 1st Int. Workshop Proc. , June 1996, pp. 185--206.

....They are defined by their inputs and outputs: Private marking systems require at least the original image. Type I systems, extract the mark M from the possibly distorted image I # and use the original image as a hint to find where the mark could be in I # . Type II systems (e.g. 15] [16], 17] also require a copy of the embedded mark for extraction and just yield a yes or no answer to the question: does I # contain the mark M ( I # I K M # 0,1 ) One might expect that this kind of scheme will be more robust than the others since it conveys very little information and ....

.... to digital watermarking [70] and later a number of researchers have developed steganographic techniques based on spread spectrum ideas which take advantage of the large bandwidth of the cover medium by matching the narrow bandwidth of the embedded data to it (e.g. 63] 71] 72] 47] In [16], Cox et al. present an image watermarking method in which the mark is embedded in the n most perceptually significant frequency components V = v i n i=1 of an image s discrete cosine transform to provide greater robustness to JPEG compression. The watermark is a sequence of real numbers W ....

[Article contains additional citation context not shown here]

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia." In Anderson [5], pp. 183-- 206, ISBN 3-540-61996-8.

....side. This correlation yields a high value when the watermark has been obtained with the proper key. As we have shown in [4] it is possible to improve the performance of the detector by eliminating original image induced noise with signal processing. It is worthy of remark that some authors [5] propose using the original image in the detection process. Although this simplifies further treatment of the watermark in the reeiver end, it is quite unrealistic for most applications, particularly those related to E commerce. Once the presence of the watermark has been correctly detected, it ....

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information Hiding (G. Goos, J. Hartmanis, and J. Leeuwen, eds.), vol. 1174 of Lecture Notes in Computer Science, (University of Cambridge, UK), pp. 185--206, Springer-Verlag, May 1996.

....signal. More recently, additive spread spectrum based methods, which embed information by linearly combining the host signal with a small pseudo noise signal that is modulated by the embedded signal, have received considerable attention in the literature as an alternative to LBM type methods [10, 11, 12, 13]. In this paper we show that both LBM type strategies and additive spread spectrum are in general not good choices for most information embedding and digital watermarking applications. As an alternative, this paper introduces a new class of information embedding strategies we refer to as ....

....[21] 6 The simplest of such methods have purely additive embedding functions of the form s(x, m) x w(m) 2) where w(m) is typically a pseudo noise sequence. Such embedding methods are often referred to as additive spread spectrum methods, and some of the earliest examples are described in [24, 25, 10, 26, 11, 12]. Typically, w(m) takes the form w(m) a(m)v (3) where v is a unit energy spreading vector and a(m) is a scalar function of the message. 3 It is often convenient to view additive spread spectrum as perturbation of a projection. In particular, substituting (3) into (2) and using that v has unit ....

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia, " in Information Hiding. First International Workshop Proceedings, pp. 185--206, June 1996.

....host image is used to embed the signatures. In checking for the presence of a signature, the quality of the reconstruction of the signature itself is not an issue. A binary decision for the presence or absence of a signature need to be made. We use a measure similar to the one defined in [3] to compute the cross correlation between the recovered signature and the original signature in the wavelet transform domain. This similarity is defined as: 2) Note that the similarity computed as above does not guarantee that the maximum value is 1.0. A graph of this similarity for varying JPEG ....

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure Robust watermark for Multimedia," Information Hiding, Lecture Notes in Computer Science, Vol. 1174, pp.183-206, 1996.

....by standard image processing operations. Research on digital watermarking can be categorized into two broad classes depending on the data embedding domain. While one is based on embedding data in the spatial domain [1] the other is based on injection in the frequency or transform domain [2,3,4,5,6]. Most of the recent research on watermarking emphasize the transform domain approach. Cox, et. al [2] proposed the spread spectrum coding method for digital watermarking, and used the DCT transform coefficients for data embedding. Their method is very robust to image transformations because ....

....broad classes depending on the data embedding domain. While one is based on embedding data in the spatial domain [1] the other is based on injection in the frequency or transform domain [2,3,4,5,6] Most of the recent research on watermarking emphasize the transform domain approach. Cox, et. al [2] proposed the spread spectrum coding method for digital watermarking, and used the DCT transform coefficients for data embedding. Their method is very robust to image transformations because they embedded small amounts of information in widely spread frequency bands. Other researchers too have ....

[Article contains additional citation context not shown here]

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure Robust watermark for Multimedia," IEEE Tr-IP., Vol. 6. no. 12, pp. 1673-1687, 1997.

....in to a host, we get the watermarked or embedded data. The recovered data, also referred to as the reconstructed data, is the signature that is extracted from the embedded data. 1. 1 Previous Work One of the early techniques for watermarking is the spread spectrum method proposed by Cox et al. [2]. The basic idea is to distribute the message or signature information over a wide range of frequencies of the host data. Many researchers have used the discrete cosine or the discrete wavelet transform coefficients to embed the signature data. While much of the initial work was on watermarking ....

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure Robust watermark for Multimedia," IEEE Trans. Image Processing, Vol. 6. no. 12, pp. 1673-1687, December 1997.

....illegal copying and copyright piracy simple. This has created a need to embed copyright data in the content in an indelible way. Particularly if watermark detection is part of an active copy control concept on Consumer Electronics (CE) and PC platforms, typical requirements include: 1] 2] 3] [4], 5] and [6] 1. Erasing or altering the watermark should be difficult. 2. The watermarking scheme should be robust against typical transmission and storage imperfections (such as lossy compression, noise addition, format conversion, bit errors) and signal processing artefacts (noise reduction, ....

....0, where Rw;w (0) Ew =N . We have seen that purely white watermarks cannot be absolutely DC free, but have D 0 = p Ew =N Low pass watermark As an other example, we will treat the case that the watermark has a low pass spatial spectrum. This method has been advocated for instance by Cox et al. [4]. In such situation, a potential attacker can less easily tamper with the watermark by low pass filtering. Moreover, JPEG compression typically removes or distorts high frequency components. A low pass watermark can be generated by spatially filtering a (quasi ) white watermark. Perceptually A ....

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

....for security and for bit stream control and manipulation. Keywords: digital watermarking, data hiding, color image processing, multidimensional lattice structure 1 Introduction Digital watermarking is one approach to protecting the rights on the digital media while not being too obtrusive [1,2,3]. For example, a digitally watermarked image is obtained by invisibly hiding signature information into the host image. The signature is only recoverable by the owner who has the key to decoding the hidden data. Most of the existing watermarking techniques use pseudo random sequences or binary ....

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure Robust watermark for Multimedia," IEEE Tr-IP., Vol. 6. no. 12, pp. 1673-1687, 1997.

....robust than oblivious schemes that do not need the original image for watermark extraction. On the other hand, the application of non oblivious schemes is severely limited by the requirement of having the original image available. The NEC scheme The watermarking technique proposed by Cox et al. Cox2] has quickly become one of the most cited schemes. It does need the original image for watermark extraction (i.e. it is non oblivious) First, a pseudorandom Gaussian sequence N(0,1) with zero mean and unit variance is generated. For security reasons, the pseudo random number generator should be ....

....The logic behind this technique is to hide the watermark into the most perceptive modes of the image (the largest magnitude DCTs) in order to achieve a high degree of robustness with respect to lossy compression and most common image processing techniques. In the version described by Cox et al. Cox2] the highest energy 1000 frequency coefficients v k are modulated according to the formula v k = v k (1 a h k ) The watermarked image is obtained by applying the inverse DCT to the coefficients v k . The parameter a is the watermark strength and can be adjusted to achieve a reasonable ....

[Article contains additional citation context not shown here]

I. J. Cox, J. Kilian, F. T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia", Proc. of the Information Hiding: First Int. Workshop, Lecture Notes in Computer Science, vol. 1174, R. Anderson, ed., Springer-Verlag, pp. 183--206, 1996.

....robust to attacks such as compression, cropping, and some image processing than the LSB approach. Many transform domain variations exist; one type is to use the discrete cosine transformation (DCT) as a vehicle to embed information in images. Transformations can be applied over the entire image [5] to blocks through out the image [17, 19] or other variations. Many of these transformation techniques require use of the original, unmarked image to extract the watermark. In [10] a number of papers propose techniques that do not require using the original to extract the watermark [16] A method ....

I. Cox, J. Kilian, T. Shamoon, T. Leighton, "A Secure, Robust Watermark for Multimedia", In: [1] pp 185206, 1996.

....the fingerprint assigned to each user will be the user s serial number. There has been much research investigating the Marking Assumption in a variety of domains. Wagner [22] gives a taxonomy of fingerprints and suggests subtle marks for computer software. Marks have been embedded in digital video [20, 6, 9, 10], in documents [5] and in computer programs [12] In all these domains, our scheme allows these marks to be combined to form collusion resistant fingerprints. Thus our results are general, applying to a variety of digital data. Previously a weaker model of collusion secure fingerprinting was ....

I. Cox, J. Kilian, T. Leighton, T. Shamoon, A secure robust watermark for multimedia, Information Hiding, LNCS 1174, Springer-Verlag, 1996, 185--206.

....cryptological communities. Steganography concerns techniques for concealing data in the noise ettinger lanl.gov of other data. Primary applications include digital watermarking for copyright protection of digital data and covert communications. Many methods for hiding data have been proposed [3], 2] 7] but to this point there have been no quantitative methods developed for assessing the security of any of these methods. Steganography is related to, though distinct from, cryptography. The goal of a secure cryptographic method is to prevent an interceptor from gaining any information ....

I. Cox, J. Kilian, Tom Leighton, Talal Shamoon. "A Secure, Robust Watermark for Multimedia" in [1].

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Proc. Workshop on Information Hiding, Cambridge Univ., U.K., May 30--June 1, 1996, pp. 175--190.

....as importantly, it should not be trivial for an average user to circumvent the copy protection system, by for example, removing the watermark. This paper discusses the susceptibility of watermarking algorithms to tampering. We assume that the reader is aware of typical watermark methods (e.g. [2, 3, 4, 5, 6, 7]) A comprehensive review is included in [9] Section 2 describes what is meant by an unrestricted key watermark and Section 3 outlines how a public watermark will be used for copy control of DVD disks. In Section 4 we introduce some notation. In Section 5, we describe how signal processing ....

I. J. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. J. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. Cox, J. Kilian, F. T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information Hiding: First Int. Workshop Proc., R. Anderson, ed., vol. 1174 of Lecture Notes in Computer Science, pp. 185-- 206, Springer-Verlag, 1996.

....While a similar asymmetric concept exists in cryptography [1] it is not sure whether secure public watermarking can theoretically exist. This paper discusses the susceptibility of public watermarking algorithms to tampering. We assume that the reader is aware typical watermark methods (e.g. [2, 3, 4, 5, 6, 7]) and of the most basic attempts to remove the watermark, such as noise addition, filtering, shifting stretching and rotating the image, etc. as we do not cover these. In Section 2 we introduce some notation. In Section 3 we then describe a series of attacks that may be used to remove a ....

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I.J. Cox, J. Kilian, F.T. Leighton and T. Shamoon. "A secure, robust watermark for multimedia". In Information Hiding: First Int. Workshop Proc., Lecture Notes in Computer Science, volume 1174, R. Anderson, ed., Springer-Verlag, pages 185--206, 1996.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Proc. Workshop Information Hiding, Univ. of Cambridge, U.K., May 30--June 1, 1996, pp. 175--190.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Sharmoon, "A Secure Robust Watermark for Multimedia," Proceedings of the First Information Hiding Workshop -- IHW '96, Springer-Verlag LNCS, vol. 1174, pp. 185--206, 1996.

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia." In Anderson [16], pp. 183--206, ISBN 3540 -61996-8.

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, `A secure, robust watermark for multimedia,' Information Hiding Workshop, Univ. of Cambridge, pp.185--206, 1996.

No context found.

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure robust watermark for multimedia," presented at the First International Information Hiding Workshop, Cambridge, UK, Apr. 1996.

No context found.

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure robust watermark for multimedia," Information Hiding Workshop, University of Cambridge, pp. 185--206, 1996.

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information Hiding, G. Goos, J. Hartmanis, and J. Leeuwen, Eds. Berlin, Germany: Springer-Verlag, pp. 185--206.

No context found.

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Proc. Workshop on Information Hiding, May 1996, pp. 185--206.

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," Information Hiding Workshop, Univ. of Cambridge, pp.185--206, 1996.

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information hiding: first international workshop, Cambridge, U.K., May 30-June 1, 1996: proceedings, Lecture Notes in Computer Science 1174, pp. 185-206, Springer-Verlag, 1996.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Proc. First Int. Workshop on Information Hiding, R. Anderson, ed., no. 1174 in Lecture Notes in Computer Science, pp. 185--206, May/June 1996.

No context found.

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia," in Information Hiding. First International Workshop Proceedings, pp. 185--206, June 1996.

No context found.

I. J. Cox, J. Killian, T. Leighton, and T. Shamoon, "A secure Robust watermark for Multimedia," IEEE Trans. Image Processing, Vol. 6. no. 12, pp. 1673-1687, December 1997.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190.

No context found.

I. Cox, J. Kilian, T. Leighton and T. Shamoon, "A secure, robust watermark for multimedia", in Proc. Workshop on Information Hiding, Univ. of Cambridge, U.K., May 30 - June 1, 1996, pp. 175-190

No context found.

I. Cox et al., "A Secure, Robust Watermark for Multimedia, " Proc. First Int'l Workshop Information Hiding, Lecture Notes in Computer Science No. 1, 174, SpringerVerlag, Berlin, 1996, pp. 185-206.

No context found.

I.J. Cox, J. Kilian, F.T. Leighton and T. Shamoon. "A secure, robust watermark for multimedia". In Information Hiding: First Int. Workshop Proc., Lecture Notes in Computer Science, volume 1174, R. Anderson, ed., Springer-Verlag, pages 185--206, 1996.

No context found.

I. Cox, J. Kilian, F. T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia", in Information Hiding: First Int. Workshop Proc., R. Anderson, ed., vol. 1174 of Lecture Notes in Computer Science, pp. 185- 206, Springer-Verlag, 1996

No context found.

I. J. Cox, J. Kilian, F. T. Leighton, and T. Shamoon, "A secure, robust watermark for multimedia", Proc. of the 1 st Information Hiding.Workshop, edited by R. Anderson, LNCS, vol. 1174, pp. 183--206, Springer-Verlag, New York, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC