Jiri Fridrich, Arnold C. Baldoza, and Richard J. Simard. Robust digital watermarking based on key-dependent basis functions. In David Aucsmith, editor, Information Hiding: Second International Workshop, volume 1525 of Lecture Notes in Computer Science. Springer Verlag, December 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....2. A hierarchy of authorities that provides for flexibility in the licence management. Web Browser Server Client [1] Hit the [2] Identifies, authenticates Alice [3]Decides Alice s role [4] Search for [5]Shows a list of [6] Wants to download Titanic [7] Sends the protected [8]Asks for associated license [9] Send license [10] Open [11] Rights are controlled TIME LINE Figure 2: A user scenario of the system. 3 User Scenario To illustrate the system from the user s point of view, Figure 2 shows how the system evolves in a number of steps as follows: 1. Alice ....

....violations do not happen. Techniques to achieve this include watermarking and fingerprinting [6] Dittman et al. [7] present a technology for combining collusion secure fingerprinting schemes based on finite geometries and a watermarking mechanism with special marking points for images. Fridrich [8] introduces the concept of key dependent basis functions and discuss the applications to secure robust watermarking. Brin and Davis [9] describe their copy detection server which identifies copies of digital content, even for partial copies. In our system we are able to detect unaccounted ....

J. Fridrich, "Robust digital watermarking based on key-dependent basis functions," in Proceedings of Second International Workshop on Information Hiding, USA, pp. 143--157, 1998.

....wavelet transform (DWT) to meet the new requirements [2] Therefore, it is imperative to study watermarking schemes in the wavelet transform domain. In this paper, we will focus on the possibility to constmct secret wavelet filters to improve the security of watermarking applications. Fridrich [3] introduced the concept of key dependent basis functions in order to protect a watermark from hostile attacks. Hostile attacks exploit the knowledge of the watermarking algorithm to destroy or remove the watermark. By embedding the watermark information in a secret transform domain, Fridrich s ....

Jiri Fridrich, Arnold C. Baldoza, and Richard J. Simard, "Robust digital watermarking based on keydependent basis functions," in LNCS: IH, Portland, OR, USA, April 1998, vol. 1525, pp. 143 - 157.

.... DEFEAT HVS BASED WATERMARKING Although the human visual model helps to maximize the capacity of an embedded watermark, it is not entirely understood whether or not it provides a higher degree of security because the watermarked image carries a clue about the strength and location of the watermark [7]. For example, Cox et al. 4] hid their watermarks in the first 1000 AC coefficients in the DCT domain. Podilchk and Zeng s watermark [23] was embedded according to masking effects of human perception. In order to prevent the embedded watermark from being successfully attacked, we adopt the same ....

J. Fridrich, A. C. Baldoza, and R. J. Simard, "Robust Digital Watermarking Based on Key-Dependent Basis Functions", Second Inter. Workshop on Information Hiding, USA, pp. 143-157, 1998.

No context found.

Jiri Fridrich, Arnold C. Baldoza, and Richard J. Simard. Robust digital watermarking based on key-dependent basis functions. In David Aucsmith, editor, Information hiding: second international workshop, volume 1525, Portland, OR, USA, April 1998.

....[1] At the same time, it is difficult to blindly remove the watermark without visibly degrading the image. This is the basic principle behind most of today s watermarking techniques [2 12] Key dependent random smooth transforms for watermarking have been first proposed in a paper by Fridrich [13]. This new concept was introduced with the intent to develop a watermarking technique for which it would be possible to implement the watermark detector as a black box that anybody could use to determine whether or not a given image is watermarked but the detector itself should not enable a pirate ....

....for clusters. Such a detector would be highly nonlinear, which is exactly what is needed for secure public watermark detector. So far, the major bottleneck of the methods that use keydependent random transforms has been the computational complexity of the algorithm that generates the transforms [13]. The GramSchmidt orthogonalization procedure is the most time consuming part of the algorithm. In this paper, we present a new fast technique for generating the random transforms. The new technique enables construction of practical and fast watermarking techniques that utilize keydependent ....

[Article contains additional citation context not shown here]

J. Fridrich, 2 Lt Arnold C. Baldoza, and Richard J. Simard, "Robust digital watermarking based on key-dependent basis functions", 2 nd Information Hiding Workshop, Portland OR, April 15--17, 1998.

....algorithm and the detector (except the secret key) and the knowledge of at least one carrier with hidden message. The concept of security also includes procedural attacks, such as the IBM attack [Cra1] or attacks based on a partial knowledge of the carrier modifications due to message embedding [Fri1] Finally, we introduce two more concepts of secure black box public watermark detectors. 2.5 Secure black box public detector is a message detector implemented in a tamper proof black box (in hardware) It is assumed that the box cannot be reverse engineered. The secret key used to read the ....

....number of people, such as adding additional captions to images or subtitles in several languages to movies, there is no motivation for intentional removal of the watermark, and the security of the watermark is not an issue. Although some candidates for a secure public detector have been proposed [Fri1] almost all watermarking schemes that have been described in the literature so far have the property that the ability to read the watermark automatically implies the ability to remove the watermark [Linn1 3, Kal1 2] The number of bits carried by the watermark could be as low as one bit or ....

[Article contains additional citation context not shown here]

J. Fridrich, "Robust digital watermarking based on key-dependent basis functions", The 2nd Information Hiding Workshop in Portland, Oregon, April 15--17, 1998.

No context found.

J. Fridrich, "Robust digital watermarking based on key-dependent basis functions", Proc. of the 2 nd Information Hiding Workshop, Portland, Oregon, April 15--17, 1998.

No context found.

Jiri Fridrich, Arnold C. Baldoza, and Richard J. Simard. Robust digital watermarking based on key-dependent basis functions. In David Aucsmith, editor, Information Hiding: Second International Workshop, volume 1525 of Lecture Notes in Computer Science. Springer Verlag, December 1998.

No context found.

J. Fridrich, "Robust digital watermarking based on key-dependent basis functions," 2nd Information Hiding Workshop, Portland, Oregon, April 15--27, 1998.

No context found.

J. Fridrich, A. C. Baldoza, and R. J. Simard, "Robust digital watermarking based on key-dependent basis functions," in Information hiding: second international workshop, D. Aucsmith, ed., Lecture notes in computer science 1525, pp. 143--157, Springer Verlag, Berlin, Germany, (Portland, OR, USA), Apr. 1998.

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