Cheater Detection Scheme for Dynamic Secret Key Generation

Abstract

Any secret sharing scheme is considered to be strong if the complexity of cryptanalysis is very high. In cryptography the brutal attack is the type of attack in which all the possible keys of the algorithm are tried for obtaining the secret. Various types of cryptanalytic methods for a given scheme are compared with complexity of the brute force attack. If the complexity of various cryptanalytic attacks is of the same order as that of brute force attack, then the system is said to be computationally strong. In our method of dynamic multi-secret sharing the security analysis mainly depends upon the application of hash function to calculate C matrix and modular arithmetic over primitive element. In this paper, two methods are proposed which remove the need of secret share distribution by the dealer using secure channel and to find out the cheater in the group.