Related papers: Generalized Secret Sharing using Permutation Order…
A {k,n}-threshold scheme based on two-dimensional memory cellular automata is proposed to share images in a secret way. This method allows to encode an image into n shared images so that only qualified subsets of k or more shares can…
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…
Secret sharing allows distributing a secret among several parties such that only authorized subsets, specified by an access structure, can reconstruct the secret. Sehrawat and Desmedt (COCOON 2020) introduced hidden access structures, that…
In a recent work, Markham and Sanders have proposed a framework to study quantum secret sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and…
We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in…
Privacy of the outsourced data is one of the major challenge.Insecurity of the network environment and untrustworthiness of the service providers are obstacles of making the database as a service.Collection and storage of personally…
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under {\em restricted local operation and classical communication}. Based on this local distinguishability analysis we…
Visual secrete sharing (VSS) is an encryption technique that utilizes human visual system in the recovering of the secret image and it does not require any complex calculation. Pixel expansion has been a major issue of VSS schemes. A number…
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
An efficient quantum secret sharing scheme is proposed. In this scheme, the particles in an entangled pair group form two particle sequences. One sequence is sent to Bob and the other is sent to Charlie after rearranging the particle…
We demonstrate the possibility of controlling the success probability of a secret sharing protocol using a quantum cloning circuit. The cloning circuit is used to clone the qubits containing the encoded information and {\em en route} to the…
We consider a secret sharing setting with a monotone access structure involving a control node and $L$ users, connected via a classical-quantum broadcast channel whose input is controlled by the control node, referred to as the dealer.…
The rising need of secret image sharing with high security has led to much advancement in lucrative exchange of important images which contain vital and confidential information. Multi secret image sharing system (MSIS) is an efficient and…
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be…
Quantum secret sharing is an encryption technique based on quantum mechanics, which utilizes uncertainty principle to achieve security in transmission. Most protocols focus on the study of quantum ($n,n$) or ($t,n$) threshold single secret…
A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…
We present a simple new technique to secure quantum key distribution relay networks using secret sharing. Previous techniques have relied on creating distinct physical paths in order to create the shares. We show, however, how this can be…
This paper considers the problem of outsourcing the multiplication of two private and sparse matrices to untrusted workers. Secret sharing schemes can be used to tolerate stragglers and guarantee information-theoretic privacy of the…
This paper presents results on generalized public key cryptography with exponentials modulo primes and composite numbers where the mapping is not one-to-one and the uniqueness is achieved by additional side information. Such transformations…
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode…