With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) p...

In a (r, n)-threshold secret sharing scheme, no group of (r − 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time. In order to deal with this issue, one may also require to have the ability to increase the threshold value from r to r′(> r), such an increment is likely to happen several times. In this paper, we study the problem o...

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

Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a (n, n)-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information recei...

In the paper, we propose three threshold secret sharing schemes that are based on difference equations. The first scheme is a (t, n)− threshold scheme which is an ideal perfect secure. The other two schemes add the restricted order structure to the set of shadows and the access structure of secret sharing policy. The basis of the access structure of one scheme allows that only subsets that cont...

The paper analyses the multiple assignment secret sharing scheme, presented at the GLOBECOM'87 Conference. It contains three technical comments and a contribution to extend the capabilities of Shamir scheme. First it is proved that the proposed multiple assignment secret sharing scheme is not perfect. In fact, the non-perfectness of the scheme is due to the non-perfectness of a certain type of ...

This research paper introduces a scheme to secure any secret value in cloud network by Mobile Proactive Secret Sharing (MPSS). This is an extension of proactive secret sharing, where contributing parties of a network hold the shares of a secret value. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareho...

In Shamir’s ( ) t n , threshold of the secret sharing scheme, a secret s is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or more than t shares; and (b) the secret cannot be obtained when there are fewer than t shares. In the secret reconstruction, participating users can be either legitimate sharehol...

Secret sharing schemes are very important techniques for the key management. To provide more efficient and flexible alternatives for the applications of secret sharing, this paper presents a dynamic multi-secret sharing scheme. A significant characteristic of the proposed scheme is that each participant has to keep only one master secret share which can be used to reconstruct different group se...