Related papers: Linear complementary dual code-based Multi-secret …
Secret sharing is an important building block in cryptography. All explicitly defined secret sharing schemes with known exact complexity bounds are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in…
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…
In this report, I explained the problem of Secret Sharing Scheme. Then based on the definition of the problem, two old methods: Blakley's Secret Sharing Scheme and Shamir's Secret Sharing are introduced. However, we explained the details of…
Multi-secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure. The secrets can be reconstructed according to the access structure…
Sharing a secret efficiently amongst a group of participants is not easy since there is always an adversary / eavesdropper trying to retrieve the secret. In secret sharing schemes, every participant is given a unique share. When the desired…
Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…
Secret Sharing techniques are now the building blocks of several security protocols. A (t;n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing…
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…
Secret image sharing deals with splitting confidential images into several shares and the original image can be reconstructed from the qualified subset of the shares. Secret sharing schemes are used in transmission and storage of private…
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…
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…
We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is…
This work proposes a $d$-dimensional quantum multi-secret sharing scheme with a cheat detection mechanism. The dealer creates multiple secrets and distributes the shares of these secrets using multi-access structures and a monotone span…
Secret sharing schemes are widely used now a days in various applications, which need more security, trust and reliability. In secret sharing scheme, the secret is divided among the participants and only authorized set of participants can…
This paper presents a new scheme to distribute secret shares using two trusted third parties to increase security and eliminate the dependency on single trusted third party. This protocol for communication between a device and two trusted…
Secret sharing is a method of dividing a secret among n par- ticipants and allows only qualified subset to reconstruct the secret and hence provides better reliability and availability of secret data.In the generalized secret sharing…
Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a…
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…
The threshold secret sharing scheme allows the dealer to distribute the share to every participant such that the secret is correctly recovered from a certain amount of shares. The traditional $(k, n)$-threshold secret sharing scheme…
An ideal secret sharing scheme is a method of sharing a secret key in some key space among a finite set of participants in such a way that only the authorized subsets of participants can reconstruct the secret key from their shares which…