In this paper will be proposed a new algorithm for secure strategic information sharing using biometric information. In classic cryptographic threshold schemes used for secret splitting and sharing there aren’t any connection between generated shares and particular participants of threshold protocol. In fact sometimes it may be useful to generate a special personalized shadows, which allow not ...

Article history: Received 15 December 2009 Received in revised form 14 April 2010 Accepted 17 April 2010

Threshold schemes are ideally suited to situations where a group of mutually suspicious individuals with conflicting interests must cooperate. The schemes allow a user to divide portions of a secret among a participants group. Any t or more participants from a participants group of n members can cooperate to regain the original secret while (t-1) or fewer participants cannot reveal anything abo...

In 1979, secret sharing schemes were first proposed by Blakley and Shamir. In a secret sharing scheme, each participant receives a share of a secret in such a way that only authorized subsets can reconstruct the secret. Later, Wu and He proposed a (t, n)-threshold scheme for sharing a secret based on a hyperspherical function (HS-TS). Their scheme give a practical algorithm to solve the problem...

Secret sharing schemes (SSS) are very important, because they are used in critical applications such as e-voting, cryptographic key distribution and sharing, secure online auctions, information hiding, and secure multiparty computation. We explained some popular algorithms of secret sharing such as threshold, graph, and visual schemes and their access structures. Besides, we discussed the limit...

An n-player (t, δ)-secure robust secret sharing scheme is a (t, n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least 1− δ, from the set of all shares even if up to t players provide incorrect shares. The existing constructions of robust secret sharing schemes for the range n/3 ≤ t < n/2 have the share size larger than the se...

In [1], Li et al. proposed a new type of signature scheme, called the (t, n) thresholdmutisignature scheme. The first one needs a mutually trusted share distribution center (SDC) while the second one does not. In this paper, we present a security analysis on their second schemes. We point out that their second threshold-multisignature scheme is vulnerable to universal forgery by an insider atta...

A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions is called the access structure. An access structure is called monotone if every coalition containing a qualif...

A common drawback of the image sharing with steganography approaches is that the revealed secret image is distorted due to the truncation of the grayscale secret image. To lossless reveal the secret image in the (t, n)threshold, we provide a novel sharing scheme in this article. Moreover, the original host image can be recovered by the embedded shadow images. To accomplish the above purposes, t...