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...

For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rus...

A (t, n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t − 1 participants can. In this paper, we propose two secret sharing schemes using non-abelian groups. One scheme is the special case where all the participants must get together to recover the secret. The other one is a (t, n)-thr...

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique ...

A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this en...

In this article, the authors propose an approach for privacy preserving distributed clustering that assumes malicious model. In the literature, there do exist, numerous approaches that assume a semi honest model. However, such an assumption is, at best, reasonable in experimentations; rarely true in real world. Hence, it is essential to investigate approaches for privacy preservation using a ma...

A publicly verifiable secret sharing (PVSS) scheme, proposed by Stadler in [Sta96], is a VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. PVSS can play essential roles in the systems using VSS. Achieving simultaneously the following two features for PVSS is a challenging job: – Efficient non-interactive public verification. – Pr...

Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial inf...

Secret sharing is a cryptographic scheme that divides a secret key s to n participants with threshold t. Thus, assuring that no less than t shares can reconstruct the secret. The application of secret sharing also widens not only one group but several hierarchical structure. However, the group-based secret sharing proposed by Liu et al. in 2014 has some drawbacks, which are having an equal thre...

Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secret-sharing schemes realizing general access structures is exponential in the number of parties in the access structure, making them impractical. On the other hand, the best lower bound known for sharing of an `-bit secret with re...