Permutation of Pixels within the Shares of Visual Cryptography using KBRP for Enhanced Security

Abstract

Abstract — The security of authentication of internet based co-banking services should not be susceptible to high risks. The passwords are highly vulnerable to virus attacks due to the lack of high end embedding of security methods. In order for the passwords to be more secure, people are generally compelled to select jumbled up character based passwords which are not only less memorable but are also equally prone to insecurity. Multiple use of distributed shares has been studied to solve the problem of authentication by algorithms based on thresholding of pixels in image processing and visual cryptography concepts where the subset of shares is considered for the recovery of the original image for authentication using correlation function[1][2].The main disadvantage in the above study is the plain storage of shares and also one of the shares is being supplied to the customer, which will lead to the possibility of misuse by a third party. This paper proposes a technique for scrambling of pixels by key based random permutation (KBRP) within the shares before the authentication has been attempted. Total number of shares to be created is dependent on the multiplicity of ownership of the account. By this method the problem of uncertainty among the customers with regard to security, storage, retrieval of holding of half of the shares is minimized. Index Terms—visual cryptography, correlation function, pixel expansion, shares, KBRP