Optimal visual cryptographic scheme with multiple share creation for multimedia applications

被引:7
作者
Geetha, P. [1 ]
Jayanthi, V. S. [2 ]
Jayanthi, A. N. [3 ]
机构
[1] Hindusthan Coll Engn & Technol, Elect & Commun Engn Dept, Coimbatore, Tamil Nadu, India
[2] Rajagiri Sch Engn & Technol, Elect & Commun Engn Dept, Cochin, Kerala, India
[3] Sri Ramakrishna Inst Technol, Elect & Commun Engn Dept, Coimbatore, Tamil Nadu, India
关键词
Multimedia; Visual cryptography; Peak signal noise ratio (PSNR); Mean square error (MSE); Correlation coefficient (CC); Elliptic curve cryptography (ECC); Oppositional gray wolf optimizer (OGWO); IMAGE ENCRYPTION; STEGANOGRAPHY; DISPATCH;
D O I
10.1016/j.cose.2018.07.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The criminal activity of hackers to retrieve the highly secured information on multimedia application generates major security concerned problems towards the human life. Basically, the visual cryptographic scheme generates numerous unreasonable image shares with specific information. The secret information hidden in the image can be retrieved by accumulating all the shares. The basic idea that relays on this cryptographic scheme is the encryption of image which hides the secret into m numerous image shares. By this process, it turns to be complex for the hackers to retrieve an original data of the image. Moreover, to increase the confidentiality and privacy of the original image there is in demand to make use of the efficient encryption algorithm. In this paper, the proposed visual cryptographic scheme is divided into three phases namely, (a) Separation of color bands, (b) Generation of numerous shares and (c) Optimal Encryption and Decryption. For optimal encryption and decryption of the image, we propose an OGWO based ECC (Elliptic Curve Cryptographic) approach. Initially, the input color image is separated into three color bands such as R, G and B. Subsequently, multiple image shares are generated based on the pixel measures. After this process, the shares of the image are partitioned into blocks and decrypt the original image using the optimal key generated by the OGWO (Oppositional Gray Wolf Optimization) algorithm. From the experimental analysis, we inferred that for the decrypted image PSNR achieved is 59.012, 0.11 for MSE and the CC is 1, without experiencing any deviations in the original image. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:301 / 320
页数:20
相关论文
共 47 条
[1]   Information hiding using steganography [J].
Amin, MM ;
Salleh, M ;
Ibrahim, S ;
Katmin, MR ;
Shamsuddin, MZI .
4TH NATIONAL CONFERENCE ON TELECOMMUNICATION TECHNOLOGY, PROCEEDINGS, 2003, :21-25
[2]   Visual cryptography for general access structures [J].
Ateniese, G ;
Blundo, C ;
DeSantis, A ;
Stinson, DR .
INFORMATION AND COMPUTATION, 1996, 129 (02) :86-106
[3]   Extended capabilities for visual cryptography [J].
Ateniese, G ;
Blundo, C ;
De Santis, A ;
Stinson, DR .
THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) :143-161
[4]   A new scheme for sharing secret color images in computer network [J].
Chang, CC ;
Tsai, CS ;
Chen, TS .
SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2000, :21-27
[5]  
Chang Chin-Chen, 2002, P 1 INT S CYB WORLDS
[6]  
Chavan PV, 2012, P INT C ENG
[7]  
Chen L, 2006, J OPT COMMUN, V14, P552
[8]   Color image encoding in dual fractional Fourier-wavelet domain with random phases [J].
Chen, Linfei ;
Zhao, Daomu .
OPTICS COMMUNICATIONS, 2009, 282 (17) :3433-3438
[9]   Improved genetic algorithm for power economic dispatch of units with valve-point effects and multiple fuels [J].
Chiang, CL .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2005, 20 (04) :1690-1699
[10]   Progressive viewing and sharing of sensitive images [J].
Fang W.-P. ;
Lin J.-C. .
Pattern Recognition and Image Analysis, 2006, 16 (4) :632-636