A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONS
Jayanta Kumar Pal1, J. K. Mandal2 and Kousik Dasgupta3
1Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741235, West Bengal, India
2 Department of Computer Science and Engineering, University of Kalyani,Kalyani-741235, West Bengal, India
3 Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741235, West Bengal, India
ABSTRACT
In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.
KEYWORDS
(2, n) Visual cryptography, Share
Original Source Link : http://airccse.org/journal/nsa/1010ijnsa10.pdf
No comments:
Post a Comment