Visual Cryptography Given By: Moni Naor Adi Shamir Presented By: Anil Vishnoi (2005H103017)

Slides:



Advertisements
Similar presentations
Visual Cryptography Moni Naor Adi Shamir Presented By:
Advertisements

A New Cheating Prevention Scheme For Visual Cryptography 第十六屆全國資訊安全會議 Jun Du-Shiau Tsai ab,Tzung-her Chen c and Gwoboa Horng a a Department of Computer.
Chapter 4 Systems of Linear Equations; Matrices
Chapter 4 Systems of Linear Equations; Matrices
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
1 Visual Cryptography: Secret Sharing without a Computer Ricardo Martin GWU Cryptography Group September 2005.
Grey Level Enhancement Contrast stretching Linear mapping Non-linear mapping Efficient implementation of mapping algorithms Design of classes to support.
國立暨南國際大學 National Chi Nan University A Study of (k, n)-threshold Secret Image Sharing Schemes in Visual Cryptography without Expansion Presenter : Ying-Yu.
IEEE TRANSACTIONS ON IMAGE PROCESSING,2007 指導老師:李南逸 報告者:黃資真 Cheating Prevention in Visual Cryptography 1.
Biometrics based Cryptosystem Design. Cryptosystem A mechanism using which one can encode an information content to an incomprehensible form and also.
Ch12. Secret Sharing Schemes
BY : Darshana Chaturvedi.  INTRODUCTION  RSA ALGORITHM  EXAMPLES  RSA IS EFFECTIVE  FERMAT’S LITTLE THEOREM  EUCLID’S ALGORITHM  REFERENCES.
 Caesar used to encrypt his messages using a very simple algorithm, which could be easily decrypted if you know the key.  He would take each letter.
Visual Cryptography Jiangyi Hu Jiangyi Hu, Zhiqian Hu2 Visual Cryptography Example Secret sharing Visual cryptography Model Extensions.
By Claudia Fiorini, Enrico Martinelli, Fabio Massacci
Traitor Tracing Papers Benny Chor, Amos Fiat and Moni Naor, Tracing Traitors (1994) Moni Naor and Benny Pinkas, Threshold Traitor Tracing (1998) Presented.
Secret Sharing Algorithms
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
1 Day 04- Cryptography Acknowledgements to Dr. Ola Flygt of Växjö University, Sweden for providing the original slides.
1 Constructing Pseudo-Random Permutations with a Prescribed Structure Moni Naor Weizmann Institute Omer Reingold AT&T Research.
exercise in the previous class (1)
Cryptanalysis. The Speaker  Chuck Easttom  
Practical Techniques for Searches on Encrypted Data Yongdae Kim Written by Song, Wagner, Perrig.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
The Steganographic File System Ross Anderson, Roger Needlham, Adi Shamir Presented by: Pan Meng Presented by: Pan Meng.
10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.
Secure two-party computation: a visual way by Paolo D’Arco and Roberto De Prisco.
Symmetric-Key Cryptography
Traditional Symmetric-Key Ciphers
Visual Cryptography Advanced Information Security March 11, 2010 Presenter: Semin Kim.
Visual Cryptography Hossein Hajiabolhassan Department of Mathematical Sciences Shahid Beheshti University Tehran, Iran.
Chapter 31 INTRODUCTION TO ALGEBRAIC CODING THEORY.
Information Theory Linear Block Codes Jalal Al Roumy.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
CS 376b Introduction to Computer Vision 02 / 11 / 2008 Instructor: Michael Eckmann.
Learning Objectives for Section 4.5 Inverse of a Square Matrix
Module #9 – Number Theory 1/5/ Algorithms, The Integers and Matrices.
Cryptography and Coding Theory
Image Size Invariant Visual Cryptography for General Access Structures Subject to Display Quality Constraints 報告者 : 陳建宇.
Lecture 3 Overview. Ciphers The intent of cryptography is to provide secrecy to messages and data Substitutions – ‘hide’ letters of plaintext Transposition.
Computer Science and Engineering Computer System Security CSE 5339/7339 Lecture 7 September 9, 2004.
A New Approach for Visual Cryptography Wen-Guey Tzeng and Chi-Ming Hu Designs, codes and cryptography, 27, ,2002 Reporter: 李惠龍.
 劉庭瑋 Electronic Medical Report Security Using Visual Secret Sharing Scheme.
A Study on Visual Secret Display Student: Ming-Chiang Chen Advisors: Dr. Shyong Jian Shyu and Dr. Kun-Mao Chao 1.
Public Key Cryptosystem In Symmetric or Private Key cryptosystems the encryption and decryption keys are either the same or can be easily found from each.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Prof. Reuven Aviv, Nov 2013 Public Key Infrastructure1 Prof. Reuven Aviv Tel Hai Academic College Department of Computer Science Problem Set 1: Cryptography.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
Lecture 4 Data Encryption Standard (DES) Dr. Nermin Hamza
Zurich University, 11 April  A secret sharing scheme is a method of dividing a secret S among a finite set of participants.  only certain pre-specified.
Public Key Cryptography. Asymmetric encryption is a form of cryptosystem in which Encryption and decryption are performed using the different keys—one.
Chapter 3 The Fundamentals: Algorithms, the integers, and matrices Section 3.4: The integers and division Number theory: the part of mathematics involving.
Chapter 4 Systems of Linear Equations; Matrices
(Project) by:- ROHAN HIMANSHU ANUP 70282
Ch12. Secret Sharing Schemes
Visual Secret Sharing Chair Professor Chin-Chen Chang (張真誠)
Network Security.
Encryption
The Recent Developments in Visual Cryptography
PART VII Security.
Source:Journal of Real-Time Image Processing, vol.14, pp.41-50, 2016
Learning Objectives for Section 4.5 Inverse of a Square Matrix
Network Security.
The New Developments in Visual Cryptography
A Secret Enriched Visual Cryptography
A Novel Secret Sharing Scheme from Audio Perspective
Chapter 4 Systems of Linear Equations; Matrices
Hiding Multiple Watermarks in Transparencies of Visual Cryptography
Optimal XOR based (2,n)-Visual Cryptography Schemes
Chapter 4 Systems of Linear Equations; Matrices
Presentation transcript:

Visual Cryptography Given By: Moni Naor Adi Shamir Presented By: Anil Vishnoi (2005H103017)

Contents: ► Introduction ► Terminology ► The Model ► Efficient Solution for Small K and n ► K out of K scheme ► K out of n Scheme ► Conclusion ► Reference

Introduction: ► Cryptography: Plain TextEncryptionCipher Text Plain Text DecryptionChannel

Visual Cryptography: Plaintext (in form of image) Encryption (creating shares) Channel (Fax, ) Decryption (Human Visual System)

Example: ► Secret Image Share1 Stacking the share reveals the secret Share2

Encoding of Pixels: Original Pixel Share1Share2overlaid Note: White is actually transparent

Computer Representation of pixels ► Visual Cryptography scheme represented in computer using n x m Basis matrices Original Pixel Original Pixelshare1 s1= s0= share2 overlaid Image

(2,2) Model 1. Construct two 2x2 basis matrices as: s0= 10s1= Using the permutated basis matrices, each pixel from the secret image will be encoded into two sub pixels on each participant's share. A black pixel on the secret image will be encoded on the ith participant's share as the ith row of matrix S1, where a 1 represents a black sub pixel and a 0 represents a white sub pixel. Similarly, a white pixel on the secret image will be encoded on the ith participant's share as the ith row of matrix S0.

Cont….. 3. Before encoding each pixel from the secret image onto each share, randomly permute the columns of the basis matrices S0 and S1 3.1This VCS (Visual Cryptography Scheme) divides each pixel in the secret image into m=2 sub pixels. ► 3.2It has a contrast of α(m)·m=1 and a relative contrast of α(m)=1/2.

Queries?

Conclusion:

Terminology: ► Pixel—Picture element ► Grey Level: The brightness value assigned to a pixel; values range from black, through gray, to white. ► Hamming Weight (H(V)): The number of non-zero symbols in a symbol sequence V- Vector of 1 and 1 of any length ► A qualified set of participants is a subset of Ρ whose shares visually reveal the 'secret' image when stacked together. ► A forbidden set of participants is a subset of Ρ whose shares reveal absolutely no information about the 'secret' image when stacked together.

Visual Cryptography (cont..) ► Visual Cryptography is a secret-sharing method that encrypts a secret image into several shares but requires neither computer nor calculations to decrypt the secret image. Instead, the secret image is reconstructed visually: simply by overlaying the encrypted shares the secret image becomes clearly visible ► A Visual Cryptography Scheme (VCS) on a set Ρ of n participants is a method of encoding a 'secret' image into n shares such that original image is obtained only by stacking specific combinations of the shares onto each other.

Terminology (cont…) ► The relative contrast (also called relative difference) of a VCS is the ratio of the maximum number of black sub pixels in a reconstructed (secret) white pixel to the minimum number of black sub pixels in a reconstructed (secret) black pixel. So, the lower the relative contrast in a scheme, the better. Note: the smallest relative contrast attainable in a VCS is 1/2, which is only achieved in a (2,2)-threshold VCS ► The contrast of a VCS is the difference between the minimum number of black sub pixels in a reconstructed (secret) black pixel and the maximum number of black sub pixels in a reconstructed (secret) white pixel.

The Model A solution to the k out of n visual secret sharing scheme consists of two collections of n x m Boolean (Basis) matrices S0 and S1. To share a white pixel, the dealer randomly chooses one of the matrices in S0, and to share a black pixel, the dealer randomly chooses one of the matrices in S1. The chosen matrix defines the color of the m sub pixels in each one of the n transparencies for a original pixel. The solution is considered valid if the following three conditions are met: 1. For any S in S0, the ``or'' V of any k of the n rows satisfies H(V ) <= d-α.m 2. For any S in S1, the ``or'' V of any k of the n rows satisfies H(V ) – d. n-Total Participant k-Qualified Participant

The Model (cont…) 3. For any subset {i1 ; i 2 ; : : : i q} of {1; 2; : : : n} with q < k, the two collections of q x m matrices D t for t ε {0,1} obtained by restricting each n x m matrix in C t (where t = 0; 1) to rows i1 ; i2 ; ::; iq are indistinguishable in the sense that they contain the same matrices with the same frequencies. ► Condition 3 implies that by inspecting fewer than k shares, even an infinitely powerful cryptanalyst cannot gain any advantage in deciding whether the shared pixel was white or black.

Advantage of Visual Cryptography ► Simple to implement ► Encryption don’t required any NP-Hard problem dependency ► Decryption algorithm not required (Use a human Visual System). So a person unknown to cryptography can decrypt the message. ► We can send cipher text through FAX or ► Infinite Computation Power can’t predict the message.

Basis Matrices ► Basis matrices are binary n x m used to encrypt each pixel in the secret image, where n is the number of participants in the scheme and m is the pixel expansion. The following algorithm is used to implement a VCS using basis matrices: If the n x m basis matrices S1 (used to encrypt black pixels) and S0 (used to encrypt white pixels) for any VCS are given, the secret image SI is encrypted as follows:

Basic Matrices (Cont..) for each pixel p in SI: { if (p is black) Let R = a random permutation of the columns of S1 else Let R = a random permutation of the columns of S0 for each participant i (1 <= i <= n): { The position on participant i’s share that corresponds to p is expanded into m pixels where each of these pixels j (1 <= j <= m) is black if Ri,j = 1 and white if Ri,j = 0. }}