A secret sharing scheme permits a secret to be shared among participants in such a way that only qualiied subsets of participants can recover the secret, but any non-qualiied subset has absolutely no information on the secret. In this paper we consider the problem of designing eecient secret sharing schemes having the additional feature that qualiied minorities can forbid any other set of parti...

The ( ) , t n threshold secret sharing scheme proposed by Shamir (1979) encodes the secret key into n shares and those shares are distributed among the participants. Each share incorporates an x-value uniquely designated for every single participant. If the shares are distributed on insecure (or public) channels, malicious users may acquire a few (or all) shares. If the number of shares obtaine...

The advantage of ID-based system is the simplification of key distribution and certification management; a user can directly use his identity as his public key instead of an arbitrary number, thus at the same time he can prove his identity rather than providing a certificate from CA. Now a revocable blind signature is becoming more practical; because a complete anonymity can be abused in real w...

The study of probabilistic secret sharing schemes using arbitrary probability spaces and possibly infinite number of participants lets us investigate abstract properties of such schemes. It highlights important properties, explains why certain definitions work better than others, connects this topic to other branches of mathematics, and might yield new design paradigms. A probabilistic secret s...

In this paper, a novel and efficent password based group key exchange protocol with secret sharing is proposed. Secret sharing technology is usually used to control the privileges of the authorized users to improve the robustness of the system in past years. The results are applied into designing the key exchange protocol directly, which clarify the proposed scheme. The security analysis shows ...

Reply to Comments on " Quantum Key Distribution for d-level systems for generalized Bell states " [Phys. Rev. A, 052331, (2002)] and " Quantum secret sharing based on a reusable Greenberger-Horne-Zeilinger states as secure carriers " [Phys. Abstract We show that the criticisms of two recent comments [1, 2] on the insecurity of quantum key distributions proposed in [3] and [4] and the secret sha...

In this paper, a novel key management model and algorithm for two-tier architecture network are proposed based on elliptic curve cryptosystem (ECC) combined with public key (CPK) technology, verifiable secret sharing technology, and two-tier architecture network technology. This novel key management algorithm is composed of several sub-algorithms, such as key generation, key update, nodes joini...

the present paper aimed at developing an approach based on fuzzy inference system (fis) for measuring of knowledge sharing in the organization. in recent years there has been increasing interest in the knowledge sharing by experts and managers in the world, according to increasing importance of knowledge as the key source of competitive advantage, organizations have made serious effort to find ...

We define an iterative error-minimizing secret key adapting method for multicarrier CVQKD. A multicarrier CVQKD protocol uses Gaussian subcarrier quantum continuous variables (CVs) for the transmission. The proposed method allows for the parties to reach a given target secret key rate with minimized error rate through the Gaussian subchannels by a sub-channel adaption procedure. The adaption al...