In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...

Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...

In a personal communications services system, it is required to locate the destination portable when an incoming call arrives. We propose a simple location tracking scheme called the T-threshold location cache scheme. In the scheme, a threshold T is used to determine whether a cached location record is obsolete. When the incoming call frequency changes, this scheme adaptively modifies the thres...

In this report we examine two secret sharing schemes which are based on different constructions. We present Cooper, Donovan and Seberry’s [6], Secret Sharing Scheme Arising from Latin Squares. Secondly we present Shoup’s threshold protocol based on the RSA digital signature algorithm. These two protocols will be compared in terms of their positive and negative aspects of their security.

In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07

The Secret Sharing scheme assumes long-lived shares. However the protection provided for such long lived and sensitive shares may be insufficient. The security in a system that is exposed to attacks and break-ins might become exhausted. The goal of the pro-active security scheme is to prevent the adversary from learning the secret or from destroying it. The Shamir’s Secret Sharing is pioneer me...