Cryptanalysis of Correlation-Based Watermarking Schemes Using Single Watermarked Copy Author: Tanmoy Kanti Das and Subhamoy Maitra From IEEE SIGNAL PEOCESSING.

Slides:



Advertisements
Similar presentations
Randomized Detection for Spread- Spectrum Watermarking: Defending Against Sensitivity and Other Attacks Ramarathnam Venkatesan and Mariusz H. Jakubowski.
Advertisements

Assumptions for Z Confidence Intervals
Robust Invisible Watermarking of Volume Data Y. Wu 1, X. Guan 2, M. S. Kankanhalli 1, Z. Huang 1 NUS Logo 12.
Econ 338/envr 305 clicker questions
A New Scheme For Robust Blind Digital Video Watermarking Supervised by Prof. LYU, Rung Tsong Michael Presented by Chan Pik Wah, Pat Mar 5, 2002 Department.
Sampling: Final and Initial Sample Size Determination
CHAPTER 8: Sampling Distributions
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
Chinese University of Hong Kong Department of Information Engineering A Capacity Estimate Technique for JPEG-to-JPEG Image Watermarking Peter Hon Wah Wong.
Efficient fault-tolerant scheme based on the RSA system Author: N.-Y. Lee and W.-L. Tsai IEE Proceedings Presented by 詹益誌 2004/03/02.
Lesson #17 Sampling Distributions. The mean of a sampling distribution is called the expected value of the statistic. The standard deviation of a sampling.
T T07-01 Sample Size Effect – Normal Distribution Purpose Allows the analyst to analyze the effect that sample size has on a sampling distribution.
The Sampling Distribution Introduction to Hypothesis Testing and Interval Estimation.
Right Protection via Watermarking with Provable Preservation of Distance-based Mining Spyros Zoumpoulis Joint work with Michalis Vlachos, Nick Freris and.
Normal and Sampling Distributions A normal distribution is uniquely determined by its mean, , and variance,  2 The random variable Z = (X-  /  is.
Digital Image Watermarking Er-Hsien Fu EE381K Student Presentation.
1 Applied Calculus II Confidence Tests Slides subject to change.
Chapter 13 Statistics © 2008 Pearson Addison-Wesley. All rights reserved.
A Method for Protecting Digital Images from Being Copied Illegally Chin-Chen Chang, Jyh-Chiang Yeh, and Ju-Yuan Hsiao.
Blind Pattern Matching Attack on Watermark Systems D. Kirovski and F. A. P. Petitcolas IEEE Transactions on Signal Processing, VOL. 51, NO. 4, April 2003.
Technical Seminar Presentation-2004 Presented by : ASHOK KUMAR SAHOO (EI ) NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY Presented By Ashok Kumar.
Multiple Image Watermarking Applied to Health Information Management
Chapter 10 – Sampling Distributions Math 22 Introductory Statistics.
Statistics Workshop Tutorial 5 Sampling Distribution The Central Limit Theorem.
Statistics 300: Elementary Statistics Section 6-5.
Population and Sample The entire group of individuals that we want information about is called population. A sample is a part of the population that we.
Distribution of the Sample Mean (Central Limit Theorem)
Section 6-5 The Central Limit Theorem. THE CENTRAL LIMIT THEOREM Given: 1.The random variable x has a distribution (which may or may not be normal) with.
8 Sampling Distribution of the Mean Chapter8 p Sampling Distributions Population mean and standard deviation,  and   unknown Maximal Likelihood.
Determining the Size of a Sample 1 Copyright © 2014 Pearson Education, Inc.
Assumptions for Z Confidence Intervals and Tests of Significance.
Data Hiding in Image and Video: Part II—Designs and Applications Min Wu, Heather Yu, and Bede Liu.
1 Watermarking Scheme Capable of Resisting Sensitivity Attack IEEE signal processing letters, vol. 14, no. 2, February. 2007, pp Xinpeng Zhang.
Point Estimation of Parameters and Sampling Distributions Outlines:  Sampling Distributions and the central limit theorem  Point estimation  Methods.
Course Outline Presentation Reference Course Outline for MTS-202 (Statistical Inference) Fall-2009 Dated: 27 th August 2009 Course Supervisor(s): Mr. Ahmed.
Blind image data hiding based on self reference Source : Pattern Recognition Letters, Vol. 25, Aug. 2004, pp Authors: Yulin Wang and Alan Pearmain.
1 Sampling distributions The probability distribution of a statistic is called a sampling distribution. : the sampling distribution of the mean.
Sampling Theory and Some Important Sampling Distributions.
Chapter 9: One- and Two-Sample Estimation Problems: 9.1 Introduction: · Suppose we have a population with some unknown parameter(s). Example: Normal( ,
Sampling Distributions
Chapter 5: The Basic Concepts of Statistics. 5.1 Population and Sample Definition 5.1 A population consists of the totality of the observations with which.
MMC LAB Secure Spread Spectrum Watermarking for Multimedia KAIST MMC LAB Seung jin Ryu 1MMC LAB.
Sampling Distributions Chapter 9 Central Limit Theorem.
Statistics and probability Dr. Khaled Ismael Almghari Phone No:
Research Methods. Define the Milgram experiment An experiment in which Milgram wanted to determine whether participants would administer painful shocks.
An improved SVD-based watermarking scheme using human visual characteristics Chih-Chin Lai Department of Electrical Engineering, National University of.
Statistics 270– Lecture 26.
Watermarking Scheme Capable of Resisting Sensitivity Attack
Ch5.4 Central Limit Theorem
Central Limit Theorem Section 5-5
DONE BY S.MURALIRAJAN M.NIRMAL
Statistics in Applied Science and Technology
TITLE Authors Institution RESULTS INTRODUCTION CONCLUSION AIMS METHODS
ANATOMY OF THE EMPIRICAL RULE
The Nature of Probability and Statistics
Exposing Digital Forgeries by Detecting Traces of Resampling Alin C
Nihilist Cipher.
Year-3 The standard deviation plus or minus 3 for 99.2% for year three will cover a standard deviation from to To calculate the normal.
Sampling Distributions
Sampling Distributions
Sampling Distribution of the Mean
Chapter 9: One- and Two-Sample Estimation Problems:
Source: Pattern Recognition Letters, Article In Press, 2007
Statistical Inference
Digital Watermarking for Image Authentication with Localization
Sampling Distributions
Source: Pattern Recognition Letters 29 (2008)
Novel Multiple Spatial Watermarking Technique in Color Images
An Algorithm for Removable Visible Watermarking
Authors: J.J. Murillo-Fuentes
Presentation transcript:

Cryptanalysis of Correlation-Based Watermarking Schemes Using Single Watermarked Copy Author: Tanmoy Kanti Das and Subhamoy Maitra From IEEE SIGNAL PEOCESSING LETTERS, April 2004 Presented by 詹益誌 6/8/2004

Outline Introduction How to Get Convinced That the Attack is Successful. Exact Cryptoanalytic Attack. Experimental results. Conclusions

Introduction Most of the existing digital watermarking techniques are based on correlation between “some information stored in the watermarked copy” and “related information retrieved from attacked watermarked copy”. They show how to remove this correlation to mount a cipher text-only cryptanalytic attack on these watermarking schemes.

How to Get Convinced That the Attack is Successful Theorem 1: consider two datasets v 1,…,v t and u 1,…,u t that are uncorrelated.T he mean and standard deviation of the dataset are approximately and

How to Get Convinced That the Attack is Successful Corollary 1: consider two datasets v 1,…,v t and u 1,…,u t selected at random from a standard normal distribution. The mean and standard deviation of the data u 1 -v 1,…,u t -v t are approximately

How to Get Convinced That the Attack is Successful Neither I d nor s (i) is known to the attacker, but some knowledge about statistical distribution of s (i) is known.

Exact Cryptoanalytic Attack 1.A single watermarked copy I (i) is available. Push I (i) in a stack ST of image. 2.Take the topmost image from the stack ST and consider it as I #. 3.The maximum t values of I d # are identified. DCT polynomial are formed. 4.The coefficients of the DCT polynomial are changed in a small range to create a population of several DCT polynomials and respective images are considered.

Exact Cryptoanalytic Attack 5.From the population, images are selected which are visually indistinguishable from I (i). Moreover, we analyze s (i,#) as mentioned above. If the mean and standard deviation of s (I,#) is close to 0.1 and, respectively, then we select I d # as an attacked one. 6.If required number of images are available, the terminate; otherwise go to step 2.

Experimental results

Experimental results

Conclusions Support the theoretical concepts based on statistical criteria.