In this paper, the concepts of topological space and differential manifold are introduced, it is proved that surface determined by function F (x2, x2, …, xt) class Cr in Euelidean Rt a manifold. Using intersection tangent plane hypernormal to construct shared master key participants, an intuitive, secure complete (t,n)-threshold secret sharing scheme designed. The paper be safe, probability suc...

A secret sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such...

Threshold secret sharing schemes are ideal to protect confidential information. In this paper, we propose a novel distributed threshold secret sharing scheme based on spherical coordinates. As four non-coplanar points can determine a unique sphere, we design transformation algorithms to generate secret as sphere center and mapping algorithms to convert participants to be sphere surface p...

Secret sharing method divides a secret into some components called shadow images where each shadow image looks meaningless. Based on this idea, we propose a simple secret image sharing scheme in this article. This scheme is based on bitwise operations. We have used matrix addition and subtraction processes for share generation and reconstruction processes respectively. This technique allows a s...

A (t, n) secret sharing scheme [1, 2] allows a secret to be shared among n users in such a way that only t or more users can reconstruct the secret, but any t − 1 or less users have absolutely no information about the secret. One common drawback of almost all known secret sharing schemes is that they are one-time schemes. That is, once any t or more users reconstruct the secret by pooling their...

In this paper a method for the biometric based secret sharing problem using the fuzzy vault construct is described. The secret is protected using the biometric data of the sharing parties, revealing a secret when a predetermined number of the sharing parties collaborate. The distinction between biometric cryptosystems is discussed. The basic idea of the fuzzy vault scheme is discussed. Finally ...

A secret-sharing scheme realizes the forbidden graph access structure determined by a graph G = (V,E) if a pair of vertices can reconstruct the secret if and only if it is an edge in G. Secret-sharing schemes for forbidden graph access structures of bipartite graphs are equivalent to conditional disclosure of secrets protocols, a primitive that is used to construct attributed-based encryption s...