Detection and Correction of Cheat in the Secret Sharing Schemes with Ternary Codes

Secret sharing schemes are useful in the management of cryptographic keys and in multiparty secure protocols. A secret sharing scheme permits a secret to be shared among participants in such a way that only authorized subsets of participants can recover the secret, but any unauthorized has absolutely no information on the secret. The set of all authorized subset defines the access structure to the secret. There are several approaches to the construction of secret sharing schemes. One of them is based on coding theory. It is to note that every linear code can be used to construct secret sharing schemes. On of the important problems of the secret sharing schemes is detection and correction of cheat. In this paper we present two hypotheses for detection and correction of cheat.