Using Multiple Diacritics in Arabic Scripts for Steganography By Yousef Salem Elarian Aleem Khalid Alvi 1.

Slides:



Advertisements
Similar presentations
BMP Hide ‘n’ Seek What is BMP Hide ‘n’ Seek ? –It’s a tool that lets you hide text messages in BMP files without much visible change in the picture. –Change.
Advertisements

Mohammed Aabed Sameh Awaideh Abdul-Rahman Elshafei.
1 Adnan Gutub Computer Engineering King Fahd University of Petroleum & Minerals Saudi Arabia A Novel Arabic Text Steganography Method Using Letter Points.
Python Programming Chapter 1: The way of the program Saad Bani Mohammad Department of Computer Science Al al-Bayt University 1 st 2011/2012.
Fifth International Conference on Information
ARABIC TEXT STEGANOGRAPHY USING MULTIPLE DIACRITICS Adnan Gutub Yousef Elarian Sameh Awaideh Aleem Alvi Computer Engineering Department King Fahd University.
Overview of Digital Stenography
CSCI 530L Steganography and Steganalysis. Administrative issues If you have not yet signed up for a Lab Section, do so now. Most lab sections are full.
Improving Security and Capacity for Arabic Text Steganography Using 'Kashida' Extensions By : Fahd Al-Haidari Adnan Gutub Khalid Al-Kahsah Jamil Hamodi.
On Error Preserving Encryption Algorithms for Wireless Video Transmission Ali Saman Tosun and Wu-Chi Feng The Ohio State University Department of Computer.
Dale & Lewis Chapter 3 Data Representation
Exploring Steganography: Seeing the Unseen Neil F. Johnson Sushil Jajodia George Mason University.
Compression Algorithms Robert Buckley MCIS681 Online Dr. Smith Nova Southeastern University.
Steganography Steganography refers to any methodology used to hide a message (including text, sound, or picture) in a separate file. Most commonly text.
CSC 335 Data Communications and Networking Lecture 4c: Communication and Multiplexing Dr. Cheer-Sun Yang.
Watermarking University of Palestine Eng. Wisam Zaqoot May 2010.
Digital Steganography
Three Novel Algorithms for Hiding Data in PDF Files Based on Incremental Updates Li Lei School of Information Science and Technology Sun Yat-Sen University.
Hill Cipher Developed by the mathematician Lester Hill in The encryption algorithm takes m successive plain text and substitute for them m cipher.
Lecture Objectives  To learn how to use a Huffman tree to encode characters using fewer bytes than ASCII or Unicode, resulting in smaller files and reduced.
Huijuan Yang, Alex C. Kot, IEEE Fellow IEEE Transactions on Multimedia, Vol. 9, No. 3, Apr Multimedia Security Final Project R 葉容瑜 R
Chapter 8 Cookies And Security JavaScript, Third Edition.
 The amount of data we deal with is getting larger  Not only do larger files require more disk space, they take longer to transmit  Many times files.
An Improved Algorithm to Accelerate Regular Expression Evaluation Author: Michela Becchi, Patrick Crowley Publisher: 3rd ACM/IEEE Symposium on Architecture.
Academic Scientists at Work
Communication Technology in a Changing World Week 2.
Module :MA3036NI Cryptography and Number Theory Lecture Week 3 Symmetric Encryption-2.
Part 2: Packet Transmission Packets, frames Local area networks (LANs) Wide area networks (LANs) Hardware addresses Bridges and switches Routing and protocols.
A Novel steganographic method for JPEG images by Vasiliy Sachnev - Introduction  JPEG compression  Steganography - Block based steganography method (F5)
Chapter 4 Objectives Upon completion you will be able to: Classful Internet Addressing Understand IPv4 addresses and classes Identify the class of an.
STEGANOGRAPHY AND DIGITAL WATERMARKING KAKATIYA INSTITUTE OF TECHNOLOGY AND SCIENCES,WARANGAL.
Reversible hiding in DCT-based compressed images Authors:Chin-Chen Chang, Chia-Chen Lin, Chun-Sen Tseng and Wei-Liang Tai Adviser: Jui-Che Teng Speaker:
Formatting WorksheetsFormatting Worksheets Lesson 7.
Recent Results in Combined Coding for Word-Based PPM Radu Rădescu George Liculescu Polytechnic University of Bucharest Faculty of Electronics, Telecommunications.
Huffman Codes Juan A. Rodriguez CS 326 5/13/2003.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Using Multiple Diacritics in Arabic Scripts for Steganography By Yousef Salem Elarian Aleem Khalid Alvi.
 Image based Steganography  Previous Work  Message Concealment Techniques  Using Punctuation Marks  Using modified Scytale Cipher  S-Tools Software.
Designing an Embedded Algorithm for Data Hiding using Steganographic Technique by File Hybridization G. Sahoo1 and R. K. Tiwari2 Presented by Pan Meng.
Graphics and Image Data Representations 1. Q1 How images are represented in a computer system? 2.
Implementation of Least Significant Bit Image Steganography and its Steganalaysis By: Deniz Oran Third Quarter.
Introduction to Computer Security ©2004 Matt Bishop Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester
Presenting: Yossi Salomon Noa Reiter Guides: Dr. Ofer Hadar Mr. Ehud Gonen.
Working with Cascading Style Sheets
3.3 Fundamentals of data representation
Render Sequence Encoding for Document Protection
ENCODING AND SENDING FORMATTED TEXT
Authentication Schemes for Session Passwords using Color and Images
Welcome
Steganography Example
Adnan Abdul-Aziz Gutub* and Ahmed Ali Al-Nazer
ISNE101 – Introduction to Information Systems and Network Engineering
Net 323 D: Networks Protocols
An Information Hiding Scheme Using Sudoku
Information Steganography Using Magic Matrix
Increasing Watermarking Robustness using Turbo Codes
Visit for more Learning Resources
Chair Professor Chin-Chen Chang Feng Chia University Aug. 2008
Information Steganography Using Magic Matrix
- orange white green - cyan - red - blue Example 1 24 bit RGB
Net 323 D: Networks Protocols
Embedding Secrets Using Magic Matrices
Reversible Data Hiding Scheme Using Two Steganographic Images
Information Steganography Using Magic Matrix
File Compression Even though disks have gotten bigger, we are still running short on disk space A common technique is to compress files so that they take.
一種兼顧影像壓縮與資訊隱藏之技術 張 真 誠 國立中正大學資訊工程學系 講座教授
Types of Errors Data transmission suffers unpredictable changes because of interference The interference can change the shape of the signal Single-bit.
- orange white green - cyan - red - blue Example 1 24 bit RGB
Information Hiding Techniques Using Magic Matrix
Steganographic Systems for Secret Messages
Presentation transcript:

Using Multiple Diacritics in Arabic Scripts for Steganography By Yousef Salem Elarian Aleem Khalid Alvi 1

Contents Introduction The classification tree of steganography Characteristics of the Arabic Script Related Work ApproachesEvaluationConclusion 2

Introduction Stenography is the approach of hiding the very existence of secret messages. 3

The classification tree of steganography classification tree Figure 1: classification tree 4

Characteristics of the Arabic Script The Arabic alphabet has Semitic origins derived from the Aramaic writing system. Arabic diacritic marks decorate consonant letters to specify (short) vowels. Dots and connectivity are two inherent characteristics of Arabic characters. Arabic basic alphabet of 28 letters, 15 have from one to three points, four letters can have a Hamzah, and one, ALEF, can be adorned by the elongation stroke, the Maddah 5

contd.. Little has been proposed for Arabic script steganography. Two inherent properties of Arabic writing: dots and connectability. Some work needs new fonts. Other introduces using the existent Kashidah, helped with dotted letters, instead. Hamzated characters can also be used as along with dotted ones. Figure 2. Arabic diacritic marks 6

The main idea: Diacritics Notice the differences in levels of darkness (as to the right) or colors (as below) in the single and the repeated diacritics. 7

Scenarios 1 st scenario (Secret = ) –Direct (block size = inf.) For each block b i = n d Repeat the i th diacritic n d times. Repeat the 1 st diacritic 49 extra times! –Blocked (block size = 2) Repeat the 1 st diacritic 3 extra times (3 = (11) b ); the 2 nd one, 0 extra times (0 = (00) b ); and the 3 rd one, 1 extra time (1 = (01) b ). 8

Scenarios Cntd RLE While(secret!=EOF & cover!=EOF b = b^ While(secret.b = b) Type diacritic –For Secret = Repeat the 1 st diacritic 2 times (1’s in (11) b ); the 2 nd one, 3 times (0’s in (000) b ); and the 3 rd one, 1 time (for 1). 9

Related Work Shirali-Shahreza: –The position of dots is changed to render robust, yet hidden, information. The method needs special fonts. Gutub: –Secret-bit hiding after dotted letters by inserting Kashidah’s. A small drop in capacity occurs due to restriction of script on Kashidah and due to the extra- Kashidahs. Aabed et al.: – Redundancy in diacritics is used to hide information by omitting some diacritics. 10

The textual approach The textual approach chooses a font that hides extra (or maybe all) diacritic marks completely. It uses any encoding scenario to hide secret bits in an arbitrary number of repeated but invisible diacritics. A softcopy of the file is needed to retrieve the hidden information (by special software or simply by changing the font). 11

contd.. ScenarioApproachExtradiacritics 1 st scenario (stream) Repeat the first diacritic 49 times. (49 = (110001) b ) st scenario block size=2 Repeat the first diacritic 3 times (3 = (11) b ), the second one 0 times (0 = (00) b ), and the third one 1 time (1 = (01) b ) = 4. 2 nd scenario (RLEstart=1) Repeat the first diacritic 2 times (2 = number of 1’s in (11) b ), the second one 3 times (3 = number of 0’s in (000) b ), and the third one 1 time (for 1). (2-1) + (3-1) + (1-1) = 3. Table 1. The encodings of the binary value according to the two scenarios of the first approach 12

The image approach, The image approach selects one of the fonts that slightly darken multiple occurrences of diacritics. This approach needs to convert the document into image form to survive printing. This unfortunate fact reduces the possible number of repetition of a diacritic to the one that can survive a printing and scanning process (up to 4 as the last two columns of the first diacritic 13

Approaches cont.. Figure 4: The degree of brightness of the diacritic marks repeated 1, 2, 3, 4 and 5 times each 14

ApproachCapacityrobustnesssecurity Text + softcopy High, up to infinity in 1 st scenario Not robust to printing Invisible, but in the code Image + softcopy Very low, due to image overhead Robust to printing Slightly visible. Sizeable Image + hardcopy Moderate, 1 st scenario, blocks of 2 Robust to printing Slightly visible Approaches cont.. Table 2. Comparison between the two approaches in terms of capacity, robustness and security. 15

Evaluation Approachpqr(p+r+q)/2 Dots Kashidah-Before Kashidah-After Diacritics Table 3. The ratios of usable characters for hiding both binary levels according to the three studied approaches 16

Comparison Diacritics vs. Kashidah Pros: –While Kashidah suffers from restrictions on its insertion, almost every character can bare a diacritic on it. This disadvantage of the Kashidah method becomes severer for the need of dotted character. Cons: –Diacritics never come alone; but with another character  a stable overhead of 2 bytes per secret-baring position. 17

Comparison Cntd. The Advantage The advantage of our work is that each usable character can bare multiple secret bits with 1 character as overhead. Although this same overhead can be claimed in the Kashidah method, it can’t really be applied for Kashidah becomes too long and noticeable. 18

Conclusion The text and image approaches are discussed which are used to hide information in Arabic diacritics for steganographic. This paper presents a variety of scenarios that may achieve up to arbitrary capacities. Sometimes tradeoffs between capacity, security and robustness imply that a particular scenario should be chosen. The overhead of using diacritics was, experimentally, shown very comparable to related works. The advantage of the method is that such overhead decreases if more than one diacritical secret bit is used at once. 19

The End 20