Secret sharing is concerned with the problem of how to distribute a secret among a group of n participating individuals, or entities, so that only pre-designated collections of individuals are able to recreate the secret by collectively combining their shares of secret. Sharing schemes are useful in military and civilian applications. In the traditional Secret Sharing Schemes, a shared secret information cannot be revealed without any cryptographic computations. Various Secret Sharing Schemes have been proposed. However, the size of the shares and implementation complexity in theses schemes depend on the number of participants. In other words, when a great number of participants are involved, the scheme will become impractical. A secret sharing scheme is called efficient if the total length of the n shares is polynomial in n. In the traditional Visual Secret Sharing Schemes, a shared secret information can be revealed without any cryptographic computations. In this paper we propose an n out of n uniform secret sharing scheme based on visual cryptography. This scheme provides an efficient way to hide a secret information in different shares. Further more, the size of the shares is just 1 bit more than the size of the secret, and so it does not vary when the number of participants differs.