Improved Detection of LSB Steganography in Grayscale Images

Similar documents
Resampling and the Detection of LSB Matching in Colour Bitmaps

An Implementation of LSB Steganography Using DWT Technique

Basic concepts of Digital Watermarking. Prof. Mehul S Raval

Locating Steganographic Payload via WS Residuals

Feature Reduction and Payload Location with WAM Steganalysis

Steganalysis of Overlapping Images

Stochastic Approach to Secret Message Length Estimation in ±k Embedding Steganography

Steganalytic methods for the detection of histogram shifting data-hiding schemes

Introduction to More Advanced Steganography. John Ortiz. Crucial Security Inc. San Antonio

Genetic Algorithm to Make Persistent Security and Quality of Image in Steganography from RS Analysis

Revisiting Weighted Stego-Image Steganalysis

Steganography & Steganalysis of Images. Mr C Rafferty Msc Comms Sys Theory 2005

Resampling and the Detection of LSB Matching in Colour Bitmaps

Steganography is the art of secret communication.

Steganography using LSB bit Substitution for data hiding

Application of Histogram Examination for Image Steganography

EFFECT OF SATURATED PIXELS ON SECURITY OF STEGANOGRAPHIC SCHEMES FOR DIGITAL IMAGES. Vahid Sedighi and Jessica Fridrich

An Enhanced Least Significant Bit Steganography Technique

COLOR IMAGE STEGANANALYSIS USING CORRELATIONS BETWEEN RGB CHANNELS. 1 Nîmes University, Place Gabriel Péri, F Nîmes Cedex 1, France.

AN ENHANCED EDGE ADAPTIVE STEGANOGRAPHY APPROACH USING THRESHOLD VALUE FOR REGION SELECTION

Sterilization of Stego-images through Histogram Normalization

Data Hiding Technique Using Pixel Masking & Message Digest Algorithm (DHTMMD)

LOSSLESS CRYPTO-DATA HIDING IN MEDICAL IMAGES WITHOUT INCREASING THE ORIGINAL IMAGE SIZE THE METHOD

An Integrated Image Steganography System. with Improved Image Quality

STEGANALYSIS OF IMAGES CREATED IN WAVELET DOMAIN USING QUANTIZATION MODULATION

High-Capacity Reversible Data Hiding in Encrypted Images using MSB Prediction

VARIABLE-RATE STEGANOGRAPHY USING RGB STEGO- IMAGES

IMPROVEMENTS ON SOURCE CAMERA-MODEL IDENTIFICATION BASED ON CFA INTERPOLATION

A New Image Steganography Depending On Reference & LSB

Exploration of Least Significant Bit Based Watermarking and Its Robustness against Salt and Pepper Noise

Digital Watermarking Using Homogeneity in Image

Chapter 3 LEAST SIGNIFICANT BIT STEGANOGRAPHY TECHNIQUE FOR HIDING COMPRESSED ENCRYPTED DATA USING VARIOUS FILE FORMATS

Digital Image Watermarking by Spread Spectrum method

Hiding Image in Image by Five Modulus Method for Image Steganography

Information Hiding: Steganography & Steganalysis

STEGO-HUNTER :ATTACKING LSB BASED IMAGE STEGANOGRAPHIC TECHNIQUE

ISSN (PRINT): , (ONLINE): , VOLUME-4, ISSUE-11,

A Reversible Data Hiding Scheme Based on Prediction Difference

Watermarking-based Image Authentication with Recovery Capability using Halftoning and IWT

IDENTIFYING DIGITAL CAMERAS USING CFA INTERPOLATION

A Proposed Technique For Hiding Data Into Video Files

Detecting Resized Double JPEG Compressed Images Using Support Vector Machine

International Journal of Advance Engineering and Research Development IMAGE BASED STEGANOGRAPHY REVIEW OF LSB AND HASH-LSB TECHNIQUES

Data Hiding Algorithm for Images Using Discrete Wavelet Transform and Arnold Transform

Image Enhancement using Histogram Equalization and Spatial Filtering

AN IMPROVED LSB METHOD OF STEGANOGRAPHY WITH JPEG COLORED IMAGE

Steganalysis in resized images

Digital Image Watermarking using MSLDIP (Modified Substitute Last Digit in Pixel)

Camera identification from sensor fingerprints: why noise matters

PRIOR IMAGE JPEG-COMPRESSION DETECTION

A Study on Steganography to Hide Secret Message inside an Image

Simple Additive LSB Steganography in Losslessly Encoded Images

REVERSIBLE data hiding, or lossless data hiding, hides

LSB Encoding. Technical Paper by Mark David Gan

Image Tampering Localization via Estimating the Non-Aligned Double JPEG compression

Histogram Modification Based Reversible Data Hiding Using Neighbouring Pixel Differences

CoE4TN4 Image Processing. Chapter 3: Intensity Transformation and Spatial Filtering

Compression and Image Formats

Exploiting the RGB Intensity Values to Implement a Novel Dynamic Steganography Scheme

Convolutional Neural Network-based Steganalysis on Spatial Domain

Journal of mathematics and computer science 11 (2014),

Reversible data hiding based on histogram modification using S-type and Hilbert curve scanning

Implementation of Effective, Robust and BPCS Data Embedding using LSB innovative Steganography Method

ECE/OPTI533 Digital Image Processing class notes 288 Dr. Robert A. Schowengerdt 2003

Investigation of Various Image Steganography Techniques in Spatial Domain

Colored Digital Image Watermarking using the Wavelet Technique

REVERSIBLE MEDICAL IMAGE WATERMARKING TECHNIQUE USING HISTOGRAM SHIFTING

Undercover Communication Using Image and Text as Disguise and. Countermeasures 1

A SECURE IMAGE STEGANOGRAPHY USING LEAST SIGNIFICANT BIT TECHNIQUE

Introduction to Audio Watermarking Schemes

A New Steganographic Method for Palette-Based Images

This content has been downloaded from IOPscience. Please scroll down to see the full text.

ScienceDirect. A Novel DWT based Image Securing Method using Steganography

Reversible Data Hiding in Encrypted color images by Reserving Room before Encryption with LSB Method

Implementation of a Visible Watermarking in a Secure Still Digital Camera Using VLSI Design

A Novel Approach of Compressing Images and Assessment on Quality with Scaling Factor

Retrieval of Large Scale Images and Camera Identification via Random Projections

Lossless Image Watermarking for HDR Images Using Tone Mapping

Local prediction based reversible watermarking framework for digital videos

A Secure Robust Gray Scale Image Steganography Using Image Segmentation

HYBRID MATRIX CODING AND ERROR-CORRECTION CODING SCHEME FOR REVERSIBLE DATA HIDING IN BINARY VQ INDEX CODESTREAM

RGB Intensity Based Variable-Bits Image Steganography

Image Forgery Identification Using JPEG Intrinsic Fingerprints

The Influence of Image Enhancement Filters on a Watermark Detection Rate Authors

Data Hiding Using LSB with QR Code Data Pattern Image

A Novel Image Steganography Based on Contourlet Transform and Hill Cipher

Statistics 101: Section L Laboratory 10

Modified Skin Tone Image Hiding Algorithm for Steganographic Applications

AN ADAPTIVE MORPHOLOGICAL FILTER FOR DEFECT DETECTION IN EDDY

IMAGE STEGANOGRAPHY USING MODIFIED KEKRE ALGORITHM

Digital Investigation

INFORMATION about image authenticity can be used in

Keywords Secret data, Host data, DWT, LSB substitution.

HSI Color Space Conversion Steganography using Elliptic Curve

Higher-Order, Adversary-Aware, Double JPEG-Detection via Selected Training on Attacked Samples

A New Steganographic Method Based on the Run Length of the Stego-Message. Eyas El-Qawasmeh and Alaa Alomari

Mech 296: Vision for Robotic Applications. Vision for Robotic Applications

Audio Watermarking Using Pseudorandom Sequences Based on Biometric Templates

DWT BASED AUDIO WATERMARKING USING ENERGY COMPARISON

<Simple LSB Steganography and LSB Steganalysis of BMP Images>

Transcription:

Improved Detection of LSB Steganography in Grayscale Images Andrew Ker adk@comlab.ox.ac.uk Royal Society University Research Fellow at Oxford University Computing Laboratory Information Hiding Workshop 2004

This presentation will tell you about: Summary 1. A project to evaluate the reliability of steganalytic algorithms; 2. Some potential pitfalls in this area; 3. Improved steganalysis methods: exploiting uncorrelated estimators, simplifying, by dropping the message length estimate, (applying discriminators to a segmented image); 4. Experimental evidence of improvement.

Reliability The primary aim of an Information Security Officer (Warden) is to perform a reliable hypothesis test: H 0 : No data is hidden in a given image H 1 : Data is hidden (for experiments we posit a fixed amount/proportion) (as opposed to forming an estimate of the amount of hidden data, or recovering the hidden data) A steganalysis method is a discriminating statistic for this test; by adjusting the sensitivity of the hypothesis test, false positive (type I error) and false negative (type II error) rates may be traded. Reliability is a ROC curve showing how false positives and false negatives are related.

Distributed Steganalysis Evaluation Project Applied systematically Over 200 variants of steganalysis statistics tested so far Very large image libraries are used Currently over 90,000 images in total, with more to come Images come in sets with similar characteristics. Results are produced quickly Computation performed by a heterogeneous cluster of 7-50 machines Calculations queued and results stored in a relational database Currently over 16 million rows of data, will grow to 100+ million

Scope of This Work Covers Grayscale bitmaps (which quite likely were previously subject to JPEG compression) Embedding method LSB steganography in the spatial domain using various proportions of evenly-spread pixels Particular interest in very low embedding rates (0.01-0.1 secret bits per cover pixel) Aiming to improve the closely-related steganalysis statistics Pairs [Fridrich et al, SPIE EI 03] RS a.k.a. dual statistics [Fridrich et al, ACM Workshop 01] Sample Pairs [Dumitrescu et al, IHW 02] a.k.a. Couples

The world s smallest steganography software perl -n0777e '$_=unpack"b*",$_;split/(\s+)/,<stdin>,5; @_[8]=~s{.}{$&&v254 chop()&v1}ge;print@_' <input.pgm >output.pgm stegotext

Sample Output: Histograms 500 No hidden data LSB Replacement at 5% of capacity 400 300 200 100 0-0.075-0.025 0.025 0.075 0.125 Histograms of the standard Couples statistic, generated from 5000 JPEG images

Sample Output: ROC Curves 1 Probability of detection 0.8 0.6 0.4 0.2 Generated from 5000 high-quality JPEGs 0 0 0.02 0.04 0.06 0.08 0.1 Probability of false positive ROC curves for the Couples statistic. 5% embedding (0.05bpp).

Sample Output: ROC Curves 1 Probability of detection 0.8 0.6 0.4 0.2 Generated from 5000 high-quality JPEGs Generated from 2200 uncompressed bitmaps 0 0 0.02 0.04 0.06 0.08 0.1 Probability of false positive ROC curves for the Couples statistic. 5% embedding (0.05bpp).

Some Warning Examples Set of natural bitmaps Shrink by factor x Shrink by factor y Images Images Embed data/get histograms/ compute ROC Embed data/get histograms/ compute ROC Substantially different reliability curves Conclusion The size of the cover images affects the reliability of the detector, even for a fixed embedding rate

Some Warning Examples Set of natural bitmaps Shrink by factor x Shrink by factor y Images Images Embed data/get histograms/ compute ROC Embed data/get histograms/ compute ROC Substantially different reliability curves Conclusion The size of the cover images affects the reliability of the detector, even for a fixed embedding rate. In [Ker, SPIE EI 04] we also showed that Whether and how much covers had been previously JPEG compressed affects reliability, sometimes a great deal. This effect persists even when the images are quite substantially shrunk after compression. Different resampling algorithms in the shrinking process can themselves affect reliability.

Good Methodology for Evaluation We have to concede that there is no single reliability for a particular detector. One should test reliability with more than one large set of cover images. It is important to report: a. How much data was hidden; b. The size of the covers; c. Whether they have ever been JPEG compressed, or undergone any other manipulation. Take great care in simulating uncompressed images.

How does Couples Analysis work? Simulate LSB replacement in proportion 2p of pixels by flipping the LSBs of p at random. Example cover image:

How does Couples Analysis work? As p varies, compute: E i = number of adjacent pixels whose value differs by i, and the lower value is even O i = number of adjacent pixels whose value differs by i, and the lower value is odd Both curves quadratic in p Meet at p=0 E 1 O 1 The pairs of measures odd i E3 & O E 5 & O. E & i all have the same properties. 3 5 odd i O i 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 p

How does Couples Analysis work? Compute from image under consideration Compute from image by randomizing LSBs Compute from image by flipping all LSBs p 1 p 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

How does Couples Analysis work? Assumed to meet at zero, for natural images Compute from image under consideration Compute from image by randomizing LSBs Compute from image by flipping all LSBs p 1 p 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Choice of Discriminators Unlike Pairs and RS, Couples has a number of estimators for the proportion of hidden data: ˆp from and 0 E1 O1 ˆp 1 from 3 and ˆp from and 2 E O3 E5 O5. pˆ from odd i Ei and O i odd i The last one is used in [Dumitrescu et al, IHW 02]

Choice of Discriminators 1 ˆp 0 from E1 and O1 0.8 pˆ ˆp 0 ˆp 1 ˆp 2. pˆ from E3 and O3 from E5 and O5 from Ei odd i and O i odd i Probability of detection 0.6 0.4 0.2 ˆp 1 ˆp 2 0 0 0.02 0.04 0.06 0.08 0.1 Probability of false positive ROC curves generated from 5000 JPEG images of high quality. 5% embedding (0.05bpp).

Estimators are Uncorrelated We observe that the estimators pˆi are very loosely correlated. Scattergram shows ˆp 0 & ˆp 1 when no data embedded in 5000 high-quality JPEG images; the correlation coefficient is -0.036 ˆp 1 0.12 0.08 0.04 ˆp 0 & ˆp 1 form independent discriminators 0-0.04-0.08-0.12-0.12-0.08-0.04 0 0.04 0.08 0.12 ˆp 0

Improved Couples Discriminator 1 min( pˆ, ˆ, ˆ 0 p1 p2) 0.8 Probability of detection 0.6 0.4 0.2 0 0 0.02 0.04 0.06 0.08 0.1 Probability of false positive ROC curves generated from 5000 JPEG images of high quality. 5% embedding (0.05bpp).

Dropping the Message-Length Estimate There is a much simpler sign that data has been embedded, which does not involve solving a quadratic equation: Assumed to meet at zero, for natural images E 1 O 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Dropping the Message-Length Estimate There is a much simpler sign that data has been embedded, which does not involve solving a quadratic equation: Assumed to meet at zero, for natural images Just use E E 1 1 O + O 1 1 E 1 O 1 p 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Dropping the Message-Length Estimate 1 Conventional couples 0.8 min( pˆ 0, pˆ 1, pˆ 2) Probability of detection 0.6 0.4 0.2 Relative difference E1 O1 E + O 1 1 0 0 0.02 0.04 0.06 0.08 0.1 Probability of false positive ROC curves generated from 15000 mixed JPEG images, 3% embedding.

Splitting into Segments Using the standard RS method this image, which has no hidden data, estimates an embedding rate of 6.5%.

Splitting into Segments Segment the image using the technique in [Felzenszwalb & Huttenlocher, IEEE CVPR 98] and compute the RS statistic for each segment. Taking the median gives a more robust estimate, in this case of 0.5%.

Result of Segmenting Segmenting is a bolt on which can be added to any other estimator. Here, to the modified RS method which computes the relative difference between R and R (analogous to and O ). E1 1 1 0.8 Probability of detection 0.6 0.4 0.2 10000 low quality JPEGs 5000 high quality JPEGs 7500 very mixed JPEGs Marked curves are the segmenting versions (taking the 30% percentile of per-segment statistics) 0 0 0.02 0.04 0.06 Probability of false positive ROC curves from three image sets. 3% embedding.

Experimental Evidence of Improvements We have computed very many ROC curves which depend on: which cover image set was used; (if not JPEG compressed already) how much JPEG pre-compression applied; how much data was hidden; which detection statistic is used as a discriminator. There are too many curves. The database of statistic computations is 4.3Gb! How to display all this data? We make an arbitrary decision that a reliable statistic is one which makes false positive errors at less than 5% when false negatives are 50%. For each statistic and image set display the lowest embedding rate at which this reliability is achieved.

Lowest embedding rate for which 50% false negatives achieved with no more than 5% false positives: Conventional Pairs Conventional RS Conventional Couples RS w/ optimal mask Improved Pairs [Fridrich et al, SPIE EI 03] [Fridrich et al, ACM Workshop 01] [Dumitrescu et al, IHW 02] [Ker, SPIE EI 04] Improved Couples min( pˆ ˆ ˆ 0, p1, p2) Relative difference of E1 & O1 (using non-overlapping pixel groups) Relative difference of R, R (using optimal mask and non-overlapping pixel groups and segmenting the image into 6-12 groups, taking 30 th percentile of the persegment statistics) Presented here

Lowest embedding rate for which 50% false negatives achieved with no more than 5% false positives: 2200 bitmaps Conventional Pairs Conventional RS Conventional Couples RS w/ optimal mask Improved Pairs Improved Couples min( pˆ ˆ ˆ 0, p1, p2) Relative difference of E1 & O1 (using non-overlapping pixel groups) 10% 11% 9% 10% 8% 3.2% 8.5% Relative difference of R, R (using optimal mask and non-overlapping pixel groups and segmenting the image into 6-12 groups, taking 30 th percentile of the persegment statistics) --

Lowest embedding rate for which 50% false negatives achieved with no more than 5% false positives: 2200 bitmaps + JPEG compression none q.f. 50 Conventional Pairs Conventional RS Conventional Couples RS w/ optimal mask Improved Pairs Improved Couples min( pˆ, ˆ, ˆ 0 p1 p2) 10% 11% 9% 10% 8% 3.2% 6% 5.5% 5% 5% 2.8% 1.8% Relative difference of E1 & O1 (using non-overlapping pixel groups) 8.5% 0.8% Relative difference of R, R (using optimal mask and non-overlapping pixel groups and segmenting the image into 6-12 groups, taking 30 th percentile of the persegment statistics) -- --

Lowest embedding rate for which 50% false negatives achieved with no more than 5% false positives: 2200 bitmaps + JPEG compression none q.f. 50 5000 JPEGs (high quality) 10000 JPEGs (low quality) 7500 JPEGs (very mixed) Conventional Pairs 10% 6% 4% 1.8% 7% Conventional RS 11% 5.5% 2.8% 1.6% 7% Conventional Couples 9% 5% 3% 1.4% 6.5% RS w/ optimal mask 10% 5% 2.2% 1.2% 5.5% Improved Pairs 8% 2.8% 3% 1.2% 5% Improved Couples min( pˆ, ˆ, ˆ 0 p1 p2) 3.2% 1.8% 2% 3.8% 3.6% Relative difference of E1 & O1 (using non-overlapping pixel groups) 8.5% 0.8% 2.4% 0.6% 2.8% Relative difference of R, R (using optimal mask and non-overlapping pixel groups and segmenting the image into 6-12 groups, taking 30 th percentile of the persegment statistics) -- -- 1.4% 0.5% 2.0%

The End