Robustness and security of digital watermarks

Matheson, Lesley R.; Mitchell, Stephen G.; Shamoon, T.; Tarjan, Robert E.; Zane, Francis

doi:10.1007/bfb0055486

Cited by 25 publications

(6 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(See Matheson et al [1998] and Petitcolas et al [1999].) Here we concentrate on watermarking programs, as in Collberg and Thomborson [2000] and Naccache et al [1999].…”

Section: Watermarking and Obfuscationmentioning

confidence: 99%

On the (im)possibility of obfuscating programs

Barak

Goldreich

Impagliazzo

et al. 2012

J. ACM

354

View full text Add to dashboard Cite

Informally, an obfuscator O is an (efficient, probabilistic) "compiler" that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is "unintelligible" in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic and complexity-theoretic applications, ranging from software protection to homomorphic encryption to complexity-theoretic analogues of Rice's theorem. Most of these applications are based on an interpretation of the "unintelligibility" condition in obfuscation as meaning that O(P) is a "virtual black box," in the sense that anything one can efficiently compute given O(P), one could also efficiently compute given oracle access to P.In this work, we initiate a theoretical investigation of obfuscation. Our main result is that, even under very weak formalizations of the above intuition, obfuscation is impossible. We prove this by constructing a family of efficient programs P that are unobfuscatable in the sense that (a) given any efficient program P that computes the same function as a program P ∈ P, the "source code" P can be efficiently reconstructed, yet (b) given oracle access to a (randomly selected) program P ∈ P, no efficient algorithm can reconstruct P (or even distinguish a certain bit in the code from random) except with negligible probability.We extend our impossibility result in a number of ways, including even obfuscators that (a) are not necessarily computable in polynomial time, (b) only approximately preserve the functionality, and (c) only need to work for very restricted models of computation (TC 0 ). We also rule out several potential applications of obfuscators, by constructing "unobfuscatable" signature schemes, encryption schemes, and pseudorandom function families.A preliminary version of this article appeared in

show abstract

“…(See Matheson et al [1998] and Petitcolas et al [1999].) Here we concentrate on watermarking programs, as in Collberg and Thomborson [2000] and Naccache et al [1999].…”

Section: Watermarking and Obfuscationmentioning

confidence: 99%

On the (im)possibility of obfuscating programs

Barak

Goldreich

Impagliazzo

et al. 2012

J. ACM

354

View full text Add to dashboard Cite

show abstract

“…Then a natural problem yields: is there a proper metric to evaluate robustness before embedding data? In [20], authors defined robustness as that watermarks should survive standard data processing, which includes data compression, noisy transmission, digital‐to‐analogue and analogue‐to‐digital conversion (such as printing and scanning), colour correction, sharpening and blurring, addition of captions, and geometric modifications such as cropping, scaling and rotation. In [21], we proposed an approximate model to predict embedding robustness.…”

Section: Introductionmentioning

confidence: 99%

Exploiting texture characteristics and spatial correlations for robustness metric of data hiding with noisy transmission

Chen

Wang

et al. 2021

IET Image Processing

View full text Add to dashboard Cite

Data hiding aims to embed a secret message into a digital object such as image by slightly modifying the object content without arousing noticeable artefacts. The resultant object containing hidden information will be sent to a desired receiver via some insecure channels, e.g. images transmitted through noisy channel, social networks are vulnerable to unknown pollution or compression by a third party, which may lead the transmitted objects to be attacked such that the reconstructed message has a significant error rate. It therefore requires us to use robust embedding strategies for data hiding to realise reliable message retrieval. To this end, in this paper, a metric model to estimate the robustness of data hiding for noisy transmission based on the statistical characteristics of cover and embedding operation is presented, the former is mainly reflected by spatial frequency and texture feature, and the latter embedding operation is mainly reflected by embedding modification. The goal is to ensure that both statistical characteristics and embedding operation can be used to maximise the embedding robustness. To the best knowledge, it is the first time to estimate robustness before data hiding by a special metric model. Experimental results show that, by combining the proposed metric model in three classical data hiding methods, i.e. BPS, DE and QIM, the robustness can be significantly improved, which demonstrates its superiority and applicability.

show abstract

“…The healthcare sector is not an exemption. One essential application of the Internet in the healthcare sector is the transmission of medical information as Electronic Patient Records (EPR) among medical institutions, which has become very prominent nowadays [1][2][3][4]. EPR typically contain the health history of a patient, including demographic data, physical examinations, laboratory tests, treatment procedures, prescriptions, radiology examinations, historic pathology, to mention but a few [5].…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Cryptosystem and Watermarking for Secure Medical Image Transmission

Okediran

2020

AJRCoS

View full text Add to dashboard Cite

Advances in computing and communication technologies have provided new methods to store and access medical data electronically and distribute them over open communication networks. Today, patients themselves can access their medical information themselves and medical information can be transmitted among medical institutions as well as stakeholders in the health sector. Accompanying these benefits are concomitant risks for patient medical records in electronic formats and strictly personal medical documentations being transmitted and accessible over open communication channels such as the Internet. Thus it is common knowledge that there should be in place network-level security measures and protocols in medical information systems. Many security schemes that were based on cryptography, watermarking and steganography have been proposed and implemented to secure medical data. However, an apt review of relevant literature revealed that in many implementations robustness against attacks is not guaranteed. Issues bordering on low embedding capacity, low robustness, low imperceptibility and bad trade tradeoff between robustness and capacity are evident in many implementations. In this paper, a hybrid Rivest-Shamir-Adleman (RSA) algorithm, Rivest Cipher 4 (RC4) algorithm and Spread Spectrum techniques were proposed for securing medical image data over open communication networks. The performance of the proposed scheme was evaluated using Peak Signal to Noise Ratio (PSNR), Signal to Noise Ratio (SNR), Mean Square Error (MSE) and Bit Error Rate (BER). For the five sample medical images used to test the scheme, the BER value is zero while the PNSR and SNR are consistent and they returned desirable high values. The MSE values for the images were low. The average values of the PSNR, SNR and MSE are 51.88 dB, 43.38 dB and 0.113 respectively. Hence, the proposed scheme is utterly revertible, robust and highly imperceptible; the original images can be retrieved by the recipient without any deformation or alteration.

show abstract

Robustness and security of digital watermarks

Cited by 25 publications

References 36 publications

On the (im)possibility of obfuscating programs

On the (im)possibility of obfuscating programs

Exploiting texture characteristics and spatial correlations for robustness metric of data hiding with noisy transmission

A Hybrid Cryptosystem and Watermarking for Secure Medical Image Transmission

Contact Info

Product

Resources

About