In this thesis we have seen some of the basic secret sharing schemes (methods), primarily Shamir’s and Blakely’s who are also initiators of the idea of the secret sharing method. By using secret sharing schemes, the dealer D splits the secret into shares and distributes them among the group of participants. Each participant gets a single share of the secret which does not give them any clue about the secret itself. By defining a (t,n)-threshold scheme, the reconstruction of the secret is possible only by combining shares of t or more participants. For any group with less than t participants no information of the secret can be gained. Shamir’s and Asmut-Bloom’s schemes have shown to be perfect, while others have not. An access structure defines the authorized sets of participants who are qualified to reconstruct the secret using their shares. In visual cryptography, apart from it being a (t, n)-threshold scheme, the construction of the secret and its belonging shares holds a mathematical calculation in the background, while the secret is reconstructed using human sight.