For most cryptosystems, by using a single-system master key there is a need to protect many important encryption and decryption keys used to achieve data security. There are three major drawbacks under this single-master key arrangement. First, if the master key is disclosed to the public by accident, then the entire system has no secrecy at all. Second, if the master key is lost, then all the keys under protection become inaccessible. Third, if the owner of the master key becomes disloyal, then all important information becomes completely available to the opponents. The secret sharing scheme was designed to overcome these problems. Shamir's (t, n)-threshold scheme is one of the most well-known examples of secret sharing schemes which provides a very simple and efficient way to share a secret among any t of the n participants. The primary goal of our research is to study the terminology and protocols behind secret sharing schemes and implement Shamir's scheme using Java. In addition, we have also introduced a new scheme for extending the Shamir's scheme on proactive network.

Cryptography Secret Sharing Shamir's secret sharing scheme Proactive Secret Sharing Implementation of Shamir's Secret Sharing