11.biometric data security using recursive visual cryptography
2 likes724 views
This document summarizes a research paper on using recursive visual cryptography and biometric authentication to securely store biometric data. The paper proposes a scheme where secrets can be recursively embedded within image shares created by visual cryptography. Additionally, biometric authentication is used to securely access the shares. The scheme involves creating shares of secrets, embedding those shares as additional secrets within other shares, and authenticating users through iris recognition before revealing embedded secrets. This allows for multiple secrets to be hidden and revealed securely through the visual cryptography and biometric authentication methods combined.
![Information and Knowledge Management www.iiste.org
ISSN 2224-5758 (Paper) ISSN 2224-896X (Online)
Vol 2, No.2, 2012
The topic of recursively hiding secrets within a share has been extensively researched.The scheme
proposed in this paper applies to images and attempts to increase the efficiency of traditional VC to make it
possible to hide extra secret information that serves as a steganographic channel. The scheme involves
recursive hiding of smaller secrets within a larger secret. It is obvious from the previous work that many
thoughts have been given to the idea of recursive information hiding within visual cryptography. However,
the idea of embedding these types of recursive shares within the share and providing biometric security at
the last level so that no previous shares would be recovered, to our knowledge, has never been considered.
4.1 Our contribution
There are two main contributions that are discussed within this paper. The first deals with recursive
creation of shares. This involves a recursive multiple resolution VC scheme which allows smaller secret to
be hidden within one large share.
The second contribution is providing biometric security to the last level of share, such that when the last
share is authenticated the upper level of embedded secrets would be revealed. The Iris recognition
algorithm would be used to provide biometric security to last level of client share.The well known
algorithm for Iris security the median metric algorithm would be implemented.
5. Proposed modules:
Data storage and retrieval: For the purpose of authentication there would a server database which
stores all the biometric images of the User, and the other information related to the user. The other database
would store all the shares created at the runtime.
5.1 Module 1: Image processing: Converting images to grey scale:
Naor and Shamir mentioned the extension of their scheme to grayscale images.That is, to represent
the grey levels of the hidden image by controlling the way how the opaque sub pixels of the sheets are
stacked together. If the number of colors is increased the contrast of the images would be reduced and
therefore would not be useful in recursive visual cryptography.[4] For the deployment of recursive visual
cryptography scheme we need to convert color images grey scale images.
5.2Module 2: Recursive Visual Cryptography
This method put forth has a secret image. Each secret is identified, two shares are created of that
secret, as in the above figure.Share1 is stored at client side and share 2 is stored at server side. In the next
level the secret image 2 is taken and this secret is embedded in the application side share. The share that is
stored at the application side has a secret embedded in it. Now this secret and share is converted into 2
shares and one stored at the client side and one store the server side.This method is followed recursively,
such that at each level a secret would be embedded in the corresponding shareThus this is the method of
recursive visual cryptography
5.2.1 Visual cryptography Algorithm:
Input:A W x H secret image P,p(i,j) of P
Output:2 shares Sm ,m=1to n;
Process:
1.Generate sharing matrices C0 and C1.
2.For each pixel p(i,j),1<i<W and 1<j<H;
3.For l as the expanded pixel 1to n;
4.For m=1 to n
4.1: If pixelp(i,j)=0(White),the pixel value
Sm (i,j)=C0(l,m)
4.2: If pixelp(i,j)=1(Black),the pixel value
Sm (i,j)=C1(l,m)
5.2.2 Recursive storing of secrets Algorithm
1.For each Sm, Sm+1=next secret,m=1to n.
2.Em=Embedded secret in share Cm ,m=Odd share;
3.Expand Em using the 2X2 secret sharing scheme
4.Go to step 1 of RVC for each new secret
33](https://image.slidesharecdn.com/11-biometricdatasecurityusingrecursivevisualcryptography-120513001238-phpapp02/85/11-biometric-data-security-using-recursive-visual-cryptography-2-320.jpg)
11.biometric data security using recursive visual cryptography
- 1. Information and Knowledge Management www.iiste.org ISSN 2224-5758 (Paper) ISSN 2224-896X (Online) Vol 2, No.2, 2012 Biometric Data Security using Recursive Visual Cryptography * LakshmiMadhuri.K. Viraj Thakur Rajesh Jaiswal Sandesh Sonawane Rohit Nalavade .Department of Computer Engineering,Pune University MAE Alandi Pune ,Maharashtra 412105,INDIA. *E-mail:[email protected] Abstract Recursive Visual cryptography takes the idea from the basic scheme of Visual cryptography to hide multiple secrets recursively in the single image. This paper proposes a scheme of recursive creation of shares using the basic scheme and embedding secrets into the shares. This results levels of share creation i.e. n- secrets equals n/2 levels. This paper also provides secured authentication for the user, using the Biometric authentication Thus the proposed paper is implemented in any of the real time applications. Keywords:Recursive Visual Cryptography, Embedding secrets, Biometric authentication, Levels of shares 1. Introduction Internet is one of the most popular communication channels but is insecure. Since it is an open and insecure medium, malicious users can intercept data. The fast growth of online applications results in the data security problem. In order to achieve data security, users need secure communication methods for transmitting secret messages over the Internet. Encryption is well-known method for achieving data security. It transforms secret information into an encrypted form, which looks like a random message. Transformation procedure is called encryption process and the result is called cipher text. A computational device is required to perform decryption of the cipher text. Therefore, the cost or efficiency of the hardware, complex algorithms and mathematical computations increase to encrypt and decrypt the data.Therefore, the cost increases and efficiency reduces. and mathematical computations increase to encrypt and decrypt the data. 2. Data security Security of data has been a major issue from many years. Using the age old technique of encryption and decryption has been easy to track for people around. Providing security to data using new technique is the need of the hour.This project uses the technique of Visual cryptography and providing biometric authentication. Thus using the above technique Recursive Visual cryptography would be implemented. 2.1Objectives • To provide security in any real time application. • To store more than one secret at a time. • To provide much more security by adding biometric authentication. 3. Visual cryptography One of the best known techniques to protect data such as image is Visual cryptography. Naor and Shamir introduced the visual cryptography scheme as a simple and secure way to allow the secret sharing of images without any cryptographic computations.VCS is a cryptographic technique that allows for the encryption of visual information such that decryption can be performed using the human visual system. The basic scheme is referred to as the -out-of- VCS which is denoted as VCS. Given an original binary image, it is encrypted in images, such that where a Boolean operation is is an image which appears as white noise, and is the number of noisy images.It is difficult to decipher the secret image using individual’s. The encryption is undertaken in such a way that one or more out of the generated images are necessary for reconstructing the original image. In the case of (2, 2) VCS, each pixel in the original image is encrypted into two sub pixels called shares.The paper proposes the scheme of share creation taken from NxN share creation,we hereby propose the scheme of 2X2 Share creation proposed in this paper. Fig.1 denotes the shares of a white pixel and a black pixel. Neither share provides any clue about the original pixel since different pixels in the secret image will be encrypted using independent random choices. When the two shares are superimposed, the value of the original pixel can be determined. If is a black pixel, we get two black sub pixels; if it is a white pixel, we get one black sub pixel and one white sub pixel. Therefore, the reconstructed image will be twice the width of the original secret image. (Note1) 4. Related work 32
- 2. Information and Knowledge Management www.iiste.org ISSN 2224-5758 (Paper) ISSN 2224-896X (Online) Vol 2, No.2, 2012 The topic of recursively hiding secrets within a share has been extensively researched.The scheme proposed in this paper applies to images and attempts to increase the efficiency of traditional VC to make it possible to hide extra secret information that serves as a steganographic channel. The scheme involves recursive hiding of smaller secrets within a larger secret. It is obvious from the previous work that many thoughts have been given to the idea of recursive information hiding within visual cryptography. However, the idea of embedding these types of recursive shares within the share and providing biometric security at the last level so that no previous shares would be recovered, to our knowledge, has never been considered. 4.1 Our contribution There are two main contributions that are discussed within this paper. The first deals with recursive creation of shares. This involves a recursive multiple resolution VC scheme which allows smaller secret to be hidden within one large share. The second contribution is providing biometric security to the last level of share, such that when the last share is authenticated the upper level of embedded secrets would be revealed. The Iris recognition algorithm would be used to provide biometric security to last level of client share.The well known algorithm for Iris security the median metric algorithm would be implemented. 5. Proposed modules: Data storage and retrieval: For the purpose of authentication there would a server database which stores all the biometric images of the User, and the other information related to the user. The other database would store all the shares created at the runtime. 5.1 Module 1: Image processing: Converting images to grey scale: Naor and Shamir mentioned the extension of their scheme to grayscale images.That is, to represent the grey levels of the hidden image by controlling the way how the opaque sub pixels of the sheets are stacked together. If the number of colors is increased the contrast of the images would be reduced and therefore would not be useful in recursive visual cryptography.[4] For the deployment of recursive visual cryptography scheme we need to convert color images grey scale images. 5.2Module 2: Recursive Visual Cryptography This method put forth has a secret image. Each secret is identified, two shares are created of that secret, as in the above figure.Share1 is stored at client side and share 2 is stored at server side. In the next level the secret image 2 is taken and this secret is embedded in the application side share. The share that is stored at the application side has a secret embedded in it. Now this secret and share is converted into 2 shares and one stored at the client side and one store the server side.This method is followed recursively, such that at each level a secret would be embedded in the corresponding shareThus this is the method of recursive visual cryptography 5.2.1 Visual cryptography Algorithm: Input:A W x H secret image P,p(i,j) of P Output:2 shares Sm ,m=1to n; Process: 1.Generate sharing matrices C0 and C1. 2.For each pixel p(i,j),1<i<W and 1<j<H; 3.For l as the expanded pixel 1to n; 4.For m=1 to n 4.1: If pixelp(i,j)=0(White),the pixel value Sm (i,j)=C0(l,m) 4.2: If pixelp(i,j)=1(Black),the pixel value Sm (i,j)=C1(l,m) 5.2.2 Recursive storing of secrets Algorithm 1.For each Sm, Sm+1=next secret,m=1to n. 2.Em=Embedded secret in share Cm ,m=Odd share; 3.Expand Em using the 2X2 secret sharing scheme 4.Go to step 1 of RVC for each new secret 33
- 3. Information and Knowledge Management www.iiste.org ISSN 2224-5758 (Paper) ISSN 2224-896X (Online) Vol 2, No.2, 2012 5.Store Sm, m=Even share stored at client side, Sm=Odd share stored at application side Our policy is to provide biometric authentication at the client end such that when biometric authentication is provided by the client the secret would be stacked on the application side hare and the secret would be revealed (Note 2) 5.3Module 3: Biometric Authentication There are various techniques provided for authentication in general scheme. Biometric authentication is the scheme provided by recognizing the human visual identity recognition. We here would be implementing the iris recognition system. (Note3) An efficient method for personal identification based on the pattern of human iris is proposed. It is composed of image acquisition, image pre-processing to make a flat iris then it is converted into Eigen iris and decision is carried out using only reduction of iris in one dimension. By comparing the Eigen irises it is determined whether two irises are similar. The results show that proposed method is quite effective. A general iris recognition system is composed of four steps. Firstly an image containing the eye is captured then image is pre processed to extract the iris. Thirdly Eigen irises are used to train the system and finally decision is made by means of matching. 5.3.1 Methodology: Image acquisition In iris recognition image acquisition is an important step. Since iris is small in size and dark in colour, it is difficult to acquire good image. The colour image is captured .The image is then changed from RGB to gray level for further processing. First of all to separate the iris from the image the boundaries of the iris and pupil are detected. Since pupil is the darkest area in the image as shown in Figure 2; so a rough estimate of its center (Cx, Cy) is performed using the following Formula Cx=arg min(x)(I∑(x,y)) Cy=arg min(y)(I(∑(x,y)) Where I(x, y) is the iris image intensity at point (x, y). To find the exact centre of the pupil, a part of image is binarized.Then using the median matrix method the image pixel intensity would be calculated and median would be calculated and stored in the array. The algorithm used here is the median matrix method; here the edges of the biometric images would be detected by using edge detection algorithm. (Note 4) During the authentication process the array would be attached and then customer would be authenticated. 5.4 Decryption After the biometric authentication is done the customer will give his part of the share. The two shares from the application side and the client side would be superimposed and if they match the secret would be revealed.This would be done for each level and the embedded secrets at each level will also be revealed. 6. Advantages The advantages of such type of Recursive Visual cryptographic scheme are: Original image security is provided. Secure Authentication is provided. Chance of fake share creation is not possible. More than one image be kept as secret .Recursive cryptography is first of the concepts to be implemented for security. 7. Experiments and results Two shares are generated Share1 and Share2 as output of visual cryptography algorithm. One share along with username is kept by system and other is given on the user card. For authentication user provides share which is on the card. The share extracted from this card is superimposed with corresponding share that is stored in the database, generates the original image. From this Iris template image feature template is generated. Now this feature template is matched with Iris feature of newly provided eye image using hamming distance. The most popular and commercial iris recognition system was developed by Daugman.Following this many iris recognition systems are proposed by researchers. As main intent of this paper is providing 34
- 4. Information and Knowledge Management www.iiste.org ISSN 2224-5758 (Paper) ISSN 2224-896X (Online) Vol 2, No.2, 2012 security to the iris template in the database, image processing algorithm for iris feature extraction are derived from. The working of proposed system is shown in figures. For enrollment a single eye image is taken from CASIA database. After performing segmentation, normalization and feature extraction feature template is generated. Iris template image (generated from feature template) and another binary image which is chosen by system Administrator is given as input to the visual cryptography algorithm. 8. Conclusion We would be trying to build a secure intense project in which security would a major issue, thus making security with the intense algorithm of Recursive visual cryptography, and adding biometric authentication to it. Various approaches adopted by researchers to secure the raw biometric data and template in database are discussed here. In this paper a method is proposed to store iris template securely in the database using visual cryptography. Experimental results indicate that by applying visual cryptography techniques on iris template for more security, matching performance of iris recognition is unaffected with extra layer of authentication. References Moni Naor and Adi Shamir,” Visual Cryptography” EUROCRYPT -1994 Vol. 950, pp. 1 – 12, 1994. WeirWeiQi and YanQueen’s.” Resolution Variant Visual Cryptography for Street View of Google Maps” in IEEE International Symposium on Circuits and Systems, 2009.ISCAS 2009, 2010, pp. 1695-1698. Arun Ross and Asem Othem ,”Visual Cryptography for Biometric Policy”,IEEE Transactions On Information Forensics And Security, Vol. 6, No. 1, March 2011 .pp70-81. Tzung Chen and Kai Hsiang Tsao,” User friendly random grid based Visual Secret Sharing” National Chiayi University, Taiwan ,ROC. Manimurugan.K.Porukumara ”Fast and Efficient Visual cryptography for Medical Images”-Sn, Anna University Coimbatore,India. Proceedings Of ICETECT 2011,pp 594-599. J. Daugman. “Biometric personal identification system based on iris analysis.” United States Patent, Patent Number: 5,291,560, 1994. Masood, K., D.M.Y. Javed and A. Basit, “Iris recognition using wavelet”. In Proceedings of the International Conference on Emerging Technologies- ICET, IEEE Xplore Press. Fig1:Pixel expansion scheme 35
- 5. Information and Knowledge Management www.iiste.org ISSN 2224-5758 (Paper) ISSN 2224-896X (Online) Vol 2, No.2, 2012 Fig 2:Recursive Visual Cryptography Fig. 3:Iris Recognition methodology 36
- 6. International Journals Call for Paper The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org Business, Economics, Finance and Management PAPER SUBMISSION EMAIL European Journal of Business and Management [email protected] Research Journal of Finance and Accounting [email protected] Journal of Economics and Sustainable Development [email protected] Information and Knowledge Management [email protected] Developing Country Studies [email protected] Industrial Engineering Letters [email protected] Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL Journal of Natural Sciences Research [email protected] Chemistry and Materials Research [email protected] Mathematical Theory and Modeling [email protected] Advances in Physics Theories and Applications [email protected] Chemical and Process Engineering Research [email protected] Engineering, Technology and Systems PAPER SUBMISSION EMAIL Computer Engineering and Intelligent Systems [email protected] Innovative Systems Design and Engineering [email protected] Journal of Energy Technologies and Policy [email protected] Information and Knowledge Management [email protected] Control Theory and Informatics [email protected] Journal of Information Engineering and Applications [email protected] Industrial Engineering Letters [email protected] Network and Complex Systems [email protected] Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL Journal of Environment and Earth Science [email protected] Civil and Environmental Research [email protected] Journal of Natural Sciences Research [email protected] Civil and Environmental Research [email protected] Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL Journal of Natural Sciences Research [email protected] Journal of Biology, Agriculture and Healthcare [email protected] Food Science and Quality Management [email protected] Chemistry and Materials Research [email protected] Education, and other Social Sciences PAPER SUBMISSION EMAIL Journal of Education and Practice [email protected] Journal of Law, Policy and Globalization [email protected] Global knowledge sharing: New Media and Mass Communication [email protected] EBSCO, Index Copernicus, Ulrich's Journal of Energy Technologies and Policy [email protected] Periodicals Directory, JournalTOCS, PKP Historical Research Letter [email protected] Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Public Policy and Administration Research [email protected] Zeitschriftenbibliothek EZB, Open J-Gate, International Affairs and Global Strategy [email protected] OCLC WorldCat, Universe Digtial Library , Research on Humanities and Social Sciences [email protected] NewJour, Google Scholar. Developing Country Studies [email protected] IISTE is member of CrossRef. All journals Arts and Design Studies [email protected] have high IC Impact Factor Values (ICV).