Related papers: Breaking Mignotte's Sequence Based Secret Sharing …
The evolving $k$-threshold secret sharing scheme allows the dealer to distribute the secret to many participants such that only no less than $k$ shares together can restore the secret. In contrast to the conventional secret sharing scheme,…
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a…
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any…
A ($t$, $n$) threshold quantum secret sharing (QSS) is proposed based on a single $d$-level quantum system. It enables the ($t$, $n$) threshold structure based on Shamir's secret sharing and simply requires sequential communication in…
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…
This paper proposes a ($k,n$)-threshold secret image sharing scheme that offers flexibility in terms of meeting contrasting demands such as information security and storage efficiency with the help of a randomized kernel (binary matrix)…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…
Quantum secret sharing (QSS) is a cryptographic protocol in which a quantum secret is distributed among a number of parties where some subsets of the parties are able to recover the secret while some subsets are unable to recover the…
Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret sharing typically does not require any computational hardness…
Shamir's celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length $\ell$ among any $N \leq 2^\ell$ players such that for a threshold parameter $t$, (i) the knowledge of any $t$ shares does not…
We propose a unitary procedure to reconstruct quantum secret for a quantum secret sharing scheme constructed from stabilizer quantum error-correcting codes. Erasure correcting procedures for stabilizer codes need to add missing shares for…
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other…
In the standard model of quantum secret sharing, typically, one is interested in minimal authorized sets for the reconstruction of the secret. In such a setting, reconstruction requires the communication of all the shares of the…
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…
The main aim of this paper is to construct a multi-secret sharing scheme for general access structure in a trusted dealer model using suitable hash function and Lagrange's interpolation method. Even though, the proposed scheme is a…
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only…
We study the properties of secret sharing schemes, where a random secret value is transformed into shares distributed among several participants in such a way that only the qualified groups of participants can recover the secret value. We…
Secret sharing allows three or more parties to share secret information which can only be decrypted through collaboration. It complements quantum key distribution as a valuable resource for securely distributing information. Here we take…
A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing…