Developments in Steganography

Smith, J. R.; Dodge, Chris

doi:10.1007/10719724_6

Cited by 13 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the proposed solution was not at all secure, it stressed the issue that the would-be secret key of DSSS can not remain a secret in some applications. Recently, new asymmetric watermarking schemes have been proposed as an interesting alternative especially for the copy protection framework [24], [25], [26], [27], [28], [29]. Although invented independently, the authors showed that these methods shared the same detection algorithm (i.e.…”

Section: Asymmetric Watermarking Methodsmentioning

confidence: 99%

An asymmetric watermarking method

Furon

Duhamel

2003

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

This article presents an asymmetric watermarking method as an alternative to classical Direct Sequence Spread Spectrum and Watermarking Costa Schemes techniques. This new method provides a higher security level against malicious attacks threatening watermarking techniques used for a copy protection purpose. This application, which is quite different from the classical copyright enforcement issue, is extremely challenging as no public algorithm is so far known to be secure enough and some proposed proprietary techniques have been already hacked. Our method is thus a try towards the proof that the Kerckhoffs principle can be stated in the copy protection framework.

show abstract

Section: Asymmetric Watermarking Methodsmentioning

confidence: 99%

An asymmetric watermarking method

Furon

Duhamel

2003

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Another idea is to embed private key information into a host signal and detect a correlation between the signal and a transformation of the signal using a public key [33]. Other correlation-based public watermarking schemes include [9,30,11]. However, such watermarks can be removed by certain attacks such as a sensitivity attack [6,21] or confusing attack [34].…”

Section: Related Workmentioning

confidence: 99%

Publicly verifiable ownership protection for relational databases

Deng

2006

Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security

View full text Add to dashboard Cite

Today, watermarking techniques have been extended from the multimedia context to relational databases so as to protect the ownership of data even after the data are published or distributed. However, all existing watermarking schemes for relational databases are secret key based, thus require a secret key to be presented in proof of ownership. This means that the ownership can only be proven once to the public (e.g., to the court). After that, the secret key is known to the public and the embedded watermark can be easily destroyed by malicious users. Moreover, most of the existing techniques introduce distortions to the underlying data in the watermarking process, either by modifying least significant bits or exchanging categorical values. The distortions inevitably reduce the value of the data. In this paper, we propose a watermarking scheme by which the ownership of data can be publicly proven by anyone, as many times as necessary. The proposed scheme is distortionfree, thus suitable for watermarking any type of data without fear of error constraints. The proposed scheme is robust against typical database attacks including tuple/attribute insertion/deletion, random/selective value modification, data frame-up, and additive attacks.

show abstract

“…In [97], Smith and Dodge differentiate also between strong and weak public key watermarking; in the former, performing the extraction with the public key gives no advantage in stripping the watermark above that provided by the access to a watermark reading oracle, while a weak public key only deals with recovering the original image. They also present a very simple asymmetric method based on periodic watermarks.…”

Section: Asymmetric Watermarkingmentioning

confidence: 99%

Transactions on Data Hiding and Multimedia Security I

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Digital watermarking is a growing research area to mark digital content (image, audio, video, etc.) by embedding information into the content itself. This technique opens or provides additional and useful features for many application fields (like DRM, annotation, integrity proof and many more). The role of watermarking algorithm evaluation (in a broader sense benchmarking) is to provide a fair and automated analysis of a specific approach if it can fulfill certain application requirements and to perform a comparison with different or similar approaches. Today most algorithm designers use their own methodology and therefore the results are hardly comparable. Derived from the variety of actually presented evaluation procedures in this paper, firstly we introduce a theoretical framework for digital robust watermarking algorithms where we focus on the triangle of robustness, transparency and capacity. The main properties and measuring methods are described. Secondly, a practical environment shows the predefined definition and introduces the practical relevance needed for robust audio watermarking benchmarking. Our goal is to provide a more partial precise methodology to test and compare watermarking algorithms. The hope is that watermarking algorithm designers will use our introduced methodology for testing their algorithms to allow a comparison with existing algorithms more easily. Our work should be seen as a scalable and improvable attempt for a formalization of a benchmarking methodology in the triangle of transparency, capacity and robustness.Abstract. Robust digital watermarking systems are important building blocks in applications such as fingerprinting, dispute resolving or direct proofs of authorship, where the presence of a watermark serves as evidence for some fact, e.g., illegal redistribution or authorship. A major drawback of (symmetric) watermarking schemes in this context is that proving the presence of a watermark requires disclosing security critical detection information (watermark, detection key, original data) to a (potentially malicious) verifying party. This may completely jeopardise the security of embedded watermarks once this information is revealed. To overcome this problem recent work on secure watermark detection proposes cryptographic proofs that perform the detection on concealed detection information. The proposed solutions focus on correlation-based detection and can be applied to any watermarking scheme whose detection criteria can be expressed as a polynomial relation between the quantities required for the detection.In this paper, we present in-depth guidelines for the adoptions required to transform well-established watermarking schemes by Cox et al and Piva et al into secure cryptographic proofs in the non-interactive setting. Moreover, we present our implementation, its performance results and the corresponding tool we have developed for this purpose. Our results underpin the practicability of the cryptographic approach.Abstract. Digital Rights Management (DRM) enforces the ri...

show abstract

Developments in Steganography

Cited by 13 publications

References 2 publications

An asymmetric watermarking method

An asymmetric watermarking method

Publicly verifiable ownership protection for relational databases

Transactions on Data Hiding and Multimedia Security I

Contact Info

Product

Resources

About