We investigate the distinguishability of orthogonal multipartite entangled states in d-qudit system by restricted local operations and classical communication. According to these properties, we propose a standard (2, n)-threshold quantum secret sharing scheme (called LOCC-QSS scheme), which solves the open question in [Rahaman et al., Phys. Rev. A, 91, 022330 (2015)]. On the other hand, we find...

We design a new (k,n)-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k 1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any k (≤n) or more shares. Both the algorithms have used simple B...

We propose a new probabilistic ID-based noninteractive key sharing scheme that has non-separable secret-key functions and a non-separable common-key function. The proposed scheme uses the calculation over modulo-P , modulo-Q and over integer ring for realizing non-separability. This proposed scheme has a large threshold against linear attack by the collusive entities. key words: ID, key sharing...

We design a new (k,n)-threshold visual secret sharing scheme on the basis of Boolean operations. We propose two different algorithms to encrypt a secret image into n meaningless shares such that no secret information can be obtained by having any k 1 or fewer shares. However, the secret image can be reconstructed easily by XOR of any k (≤n) or more shares. Both the algorithms have used simple B...

We define three privacy-preserving solutions to the problem of distributing secrets between manufacturers and vendors of items labeled with Electronic Product Code (EPC) Gen2 tags. The solutions rely on the use of an anonymous threshold secret sharing scheme that allows the exchange of blinded information between readers and tags. Moreover, our secret sharing scheme allows self-renewal of share...

We define three privacy-preserving solutions to the problem of distributing secrets between manufacturers and vendors of items labeled with Electronic Product Code (EPC) Gen2 tags. The solutions rely on the use of an anonymous threshold secret sharing scheme that allows the exchange of blinded information between readers and tags. Moreover, our secret sharing scheme allows self-renewal of share...

A new threshold scheme for the Digital Signature Standard is proposed using Asmuth-Bloom secret sharing based on the Chinese Remainder Theorem. The proposed scheme is simple and can be used practically in real life.

In this paper a new way of secret sharing algorithms expansion based on additional, linguistic stage, introduced for the generation of the secret shadow elements are presented. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequential grammar. The introduction of linguistic formalism in this scheme will provide additional information ...