A secure, robust watermark for multimedia

Cox, Ingemar J.; Kilian, Joe; Leighton, Frank Thomson; Shamoon, T.

doi:10.1007/3-540-61996-8_41

Cited by 309 publications

(193 citation statements)

References 11 publications

Supporting

Mentioning

191

Contrasting

Unclassified

Order By: Relevance

“…Here we shortly recall the major facts from the watermarking scheme by Cox et al [3] for black and white still-images as the basis for our detection protocol.…”

Section: Watermarking Scheme By Cox Et Almentioning

confidence: 99%

“…The original heuristic in Cox's watermarking scheme (see Section 2.1) requires to select the coefficients ofŴ with the m-highest magnitudes to constructŴ * [m] 3 We invert to ∆i := α · WM * i instead of WM * i, because with ∆i in the detection inequality the construction of an efficient protocol is easier to achieve, cf. Sec.…”

Section: How Verifier Determinesŵ * [M]mentioning

confidence: 99%

“…In this paper we present the concrete construction of a zero-knowledge proof system for the watermarking scheme proposed by Cox et al [3] as one example for the class of correlation-based and non-blind detectable watermarking schemes. Furthermore, we give a precise quantisation of the computation and communication complexities of the protocol.…”

Section: Introductionmentioning

confidence: 99%

“…This also includes more advanced embedding and detection strategies to improve robustness and imperceptibility with respect to the HVS as cited in [4]. We have chosen the scheme of Cox et al [3], because it is a widely known example of correlation-based watermark detection and convenient to demonstrate the practical feasibility of strong zero-knowledge watermark detection.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Adelsbach

Sadeghi

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. Cryptographic techniques have been deployed to securely prove the presence of a watermark in stego-data without disclosing any security critical information to the detecting party.This paper presents a detailed practical construction and implementation results of a correlation-based non-blind watermarking scheme in the non-interactive zero-knowledge setting. We extensively describe the modifications and hurdles that had to be overcome to transform a wellknown watermarking scheme -whose general detection principle is applied in many other known schemes -into a two-party setting where the critical detection input, i.e. the watermark vector and the original data is cryptographically concealed from the verifying party using a commitment scheme. Our prototype implementation is very efficient and is an evidence of the practical feasibility of zero-knowledge watermark detection.

show abstract

“…Here we shortly recall the major facts from the watermarking scheme by Cox et al [3] for black and white still-images as the basis for our detection protocol.…”

Section: Watermarking Scheme By Cox Et Almentioning

confidence: 99%

Section: How Verifier Determinesŵ * [M]mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme

Adelsbach

Sadeghi

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…When this watermarked media is repeatedly leaked by someone, the identity of the offender is obtained from the watermark and blacklisted. For details on watermarking and similarly motivated techniques, see [8,6,11,10].…”

Section: Introductionmentioning

confidence: 99%

Coding Constructions for Blacklisting Problems without Computational Assumptions

Kumar

Rajagopalan

Sahai³

1999

Advances in Cryptology — CRYPTO’ 99

127

View full text Add to dashboard Cite

Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2 n users so that all but some specified coalition of k excluded users can understand the contents of the message. Using error-correcting codes, and avoiding any computational assumptions in our constructions, we construct natural schemes that completely avoid any dependence on n in the transmission overhead. Specifically, we construct: (i) (for illustrative purposes,) a randomized scheme where the server's storage is exponential (in n), but the transmission overhead is O(k), and each user's storage is O(kn); (ii) a scheme based on polynomials where the transmission overhead is O(kn) and each user's storage is O(kn); and (iii) a scheme using algebraic-geometric codes where the transmission overhead is O(k 2 ) and each user is required to store O(kn) keys. In the process of proving these results, we show how to construct very good cover-free set systems and combinatorial designs based on algebraic-geometric codes, which may be of independent interest and application. Our approach also naturally extends to solve the problem in the case where the broadcast channel may introduce errors or lose information.

show abstract