A New Approach for Visual Cryptography Wen-Guey Tzeng and Chi-Ming Hu Designs, codes and cryptography, 27, 207-227,2002 Reporter: 李惠龍.

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.
Cheating prevention in visual cryptography Author: C.M. Hu and W.G. Tzeng Source: IEEE-TIP 2007 Presenter: Yu-Chi Chen Date: /4/13 1.
1 Visual Cryptography: Secret Sharing without a Computer Ricardo Martin GWU Cryptography Group September 2005.
國立暨南國際大學 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.
Ch12. Secret Sharing Schemes
Visual Cryptography Jiangyi Hu Jiangyi Hu, Zhiqian Hu2 Visual Cryptography Example Secret sharing Visual cryptography Model Extensions.
Traitor Tracing Papers Benny Chor, Amos Fiat and Moni Naor, Tracing Traitors (1994) Moni Naor and Benny Pinkas, Threshold Traitor Tracing (1998) Presented.
Matrices & Systems of Linear Equations
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
Lesson 8 Gauss Jordan Elimination
1 視覺密碼學 Chair Professor Chin-Chen Chang ( 張真誠 ) National Tsing Hua University ( 清華大學 ) National Chung Cheng University ( 中正大學 ) Feng Chia University (
Matrices. Special Matrices Matrix Addition and Subtraction Example.
New Visual Secret Sharing Schemes With Non-Expansible Shadow Size Using Non-binary Sub Pixel Ching-Nung Yang Yun-Hsiang Liang Wan-Hsiang Chou National.
Secret Sharing Algorithms
Linear Equations in Linear Algebra
(r, n)-Threshold Image Secret Sharing Methods with Small Shadow Images Xiaofeng Wang, Zhen Li, Xiaoni Zhang, Shangping Wang Xi'an University of Technology,
Linear Algebra and Image Processing
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
Systems and Matrices (Chapter5)
Diophantine Approximation and Basis Reduction
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
1 / 20 Arkadij Zakrevskij United Institute of Informatics Problems of NAS of Belarus A NEW ALGORITHM TO SOLVE OVERDEFINED SYSTEMS OF LINEAR LOGICAL EQUATIONS.
1 1.3 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra VECTOR EQUATIONS.
Secure two-party computation: a visual way by Paolo D’Arco and Roberto De Prisco.
Visual Cryptography Advanced Information Security March 11, 2010 Presenter: Semin Kim.
Visual Cryptography Hossein Hajiabolhassan Department of Mathematical Sciences Shahid Beheshti University Tehran, Iran.
Visual Secret Sharing Schemes for Plural Secret Images Allowing the Rotation of Shares Kazuki Yoneyama Wang Lei Mitsugu Iwamoto Noboru Kunihiro Kazuo Ohta.
S ECURE A UTHENTICATION USING I MAGE P ROCESSING AND V ISUAL C RYPTOGRAPHY FOR B ANKING A PPLICATIONS Guided By Prof. Rashmi Welekar Submitted By Deepti.
5.5 Row Space, Column Space, and Nullspace
Section 2.3 Properties of Solution Sets
ADVANTAGE of GENERATOR MATRIX:
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.
Linear Equation System Pertemuan 4 Matakuliah: S0262-Analisis Numerik Tahun: 2010.
Image Size Invariant Visual Cryptography for General Access Structures Subject to Display Quality Constraints 報告者 : 陳建宇.
VCPSS : A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches Sian-Jheng.
 劉庭瑋 Electronic Medical Report Security Using Visual Secret Sharing Scheme.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
Step Construction of Visual Cryptography Schemes IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 5, NO. 1, MARCH 2010 Feng Liu, Chuankun.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Visual Cryptography Given By: Moni Naor Adi Shamir Presented By: Anil Vishnoi (2005H103017)
A very brief introduction to Matrix (Section 2.7) Definitions Some properties Basic matrix operations Zero-One (Boolean) matrices.
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.
REVIEW Linear Combinations Given vectors and given scalars
1.4 The Matrix Equation Ax = b
Linear Equations in Linear Algebra
3.1 Introduction to Determinants
Ch12. Secret Sharing Schemes
Visual Secret Sharing Chair Professor Chin-Chen Chang (張真誠)
The Recent Developments in Visual Cryptography
ECE 638: Principles of Digital Color Imaging Systems
Linear Equations in Linear Algebra
Source: Signal Processing 109 (2015) 317–333
Linear Equations in Linear Algebra
The Recent Developments in Visual Secret Sharing
1.3 Vector Equations.
Source:Journal of Real-Time Image Processing, vol.14, pp.41-50, 2016
The New Developments in Visual Cryptography
A Secret Enriched Visual Cryptography
A Novel Secret Sharing Scheme from Audio Perspective
Linear Equations in Linear Algebra
Some New Issues on Secret Sharing Schemes
Secret color images sharing schemes based on XOR operation Wang Dao-Shun*, Zhang Lei, Ma Ning and Huang Lian-Sheng Department of Computer Science and.
Optimal XOR based (2,n)-Visual Cryptography Schemes
Linear Equations in Linear Algebra
Cheating and Prevention in Visual Secret Sharing
Presentation transcript:

A New Approach for Visual Cryptography Wen-Guey Tzeng and Chi-Ming Hu Designs, codes and cryptography, 27, ,2002 Reporter: 李惠龍

2 Outline Introduction The model Naor and Sharmir definition Improved definition

3 Introduction Definition Visual Cryptography is a way encrypt visual information (ie. pictures, texts) so humans can perform the decryption without the help of computers, unlike almost any other cryptographic techniques. Visual Cryptography was first introduced by Naor and Shamir at EUROCRYPT ’94.

4 Introduction Encryption Break image into n shares or shadow images.

5 Introduction Decryption n shares are required to decrypt the image. Print out the pictures on transparencies. Stack the images on top of each other.

6 Introduction Suppose a k out of n threshold scheme if used, then k shadow images must be stacked together to reveal the original image. Shadow images are combined using the OR operator. No cryptographic computation is required.

7 Introduction Example Secure image “IC” is divided into 4 shares, which is denoted by Qualified sets are all subsets of containing at least one of the three sets {1,2},{2,3},{3,4} (2,4)-threshold VCS

8 Introduction

9 The model (Naor and Sharmir) (k, n)-threshold VCS scheme Definition Hamming weight: The number of non-zero symbols in a symbol sequence. H(0110)=2 Definition OR-ed k-vector: Given a j x k matrix, it’s the k-vector where each tuple consists of the result of performing boolean OR operation on its corresponding j x 1 column vector

10 The model (Naor and Sharmir) Definition VCS scheme is a 6 tuple (n, m, S, V, α, d) n: shares, one for each transparency m: each share is a collection of m black and white sub-pixels (pixel expansion) S: n x m boolean matrix V: the grey level of the combined share If H(V) ≥ d black, if H(V) < d-αm white α: contrast, α>0 d: threshold, 1≤d≤m

11 The model (Naor and Sharmir) Definition VCS schemes where a subset is qualified iff its cardinality is k are called (k, n)-threshold visual cryptography schemes. Two collections of n x m boolean matrices ζ 0 and ζ 1 To construct a white pixel, randomly choose one of the matrices in ζ 0, and to share a black pixel, randomly choose a matrices in ζ 1. The chosen matrix will define the color of the m sub- pixels in each one of the n transparencies.

12 The model (Naor and Sharmir) 1. For any matrix S in ζ 0, the “or” operation on any k of the n rows satisfies H(V) ≤ d-αm. 2. For any matrix S in ζ 1, the “or” operation on any k of the n rows satisfies H(V) ≥ d. 3. For any subset of {1,2,…,n} with q<k, the two collection of q x m matrices B t obtained by restricting each n x m matrix in ζ t (where t ={0,1}) to rows are indistinguishable in the sense that they contains exactly the same matrices with the same frequencies.

13 The model (Naor and Sharmir) 1 and 2 defines the contrast of a VCS. 3 states the security property of (k, n)-threshold VCS. Example (3, 3)-threshold VCS Each pixel is divided into 4 sup-pixel (m=4)

14 The model (Naor and Sharmir) A black pixel: all 4 black sub-pixels A white pixel: 3 black sub-pixels and 1 white sub-pixel Verify the security property: 3 white sub-pixels and 1 black pixel ?

15 Improved definition for VCS

16 Improved definition for VCS m is called pixel expansion α(m) is called contrast, which should be as large as possible. the set of thresholds.

17 Improved definition for VCS

18 Improved definition for VCS Example for definition 2.2 Definition 2.1: VCS1 Definition 2.2: VCS2

19 Improved definition for VCS

20 Properties of VCS2 VCS2 is a generalization of VCS1, any VCS1 is a VCS2.

21 Properties of VCS2 If basis matrices S 0 and S 1 have a common column, we can delete it from S 0 and S 1 to reduce pixel expansion.

22 Properties of VCS2 Exchange the roles of S 0 and S 1 in a VCS2.

23 Properties of VCS2 Add a participant such that Q is augmented.

24 Properties of VCS2 Complete access structure: (P, Q, F) complete if F=2 P -Q, which denoted by (P, Q) is short.

25 Properties of VCS2

26 Properties of VCS2 Construct a VCS2: add an additional participant x to Γ such that some set containing x are forbidden.

27 Properties of VCS2 Concatenate the basis matrices of two VCS2 if their access structures satisfy some conditions.

28 Properties of VCS2

29 Properties of VCS2

30 Properties of VCS2

31 To be continued