Secret sharing scheme is an efficient method of transmitting one or more secret images securely. The traditional visual secret sharing schemes share only one secret image at a time. With the advancement of time, there arises a need for sharing more than one secret image. An (n, n) Multi Secret Image Sharing (MSIS) scheme is used to encrypt n secret images into n meaningless shared images and stored it in different database servers. For recovery of secrets n shared images are required. If loss of any shared image then no secret images are recovered. In earlier work n secret images are shared among n or n+1 shared images, which has a problem as one can recover partial secret information from n -- 1 or fewer shared images. Therefore, we need a more efficient and secure (n, n)-MSIS scheme so that less than n shared images does not reveal any information of secret images. In this paper, we propose an three different methods for (n, n)-MSIS scheme. First and second methods of an (n, n)- MSIS scheme, we used XOR and reverse bit operation for grayscale and colored images. In third method of an (n, n)-MSIS scheme, we used the concept of additive inverse (relative to an addition operation) and reverse bit operation for grayscale and colored images. The experimental results show that the proposed schemes requires minimal computation time for encryption and decryption. For quantitative analysis a correlation and Root Mean Square Error (RMSE) techniques are used. The proposed (n, n)-MSIS scheme outperforms the existing state-of-the-art techniques.