Results 31 to 40 of about 375,511 (221)
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ
Mark Hillery +2 more
openaire +3 more sources
An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages
Secret sharing is one of the most important cryptographic primitives used for data outsourcing. The threshold-based secret sharing scheme is one of the well-known secret sharing schemes in cryptography.
Dong Chen, Wei Lu, Weiwei Xing, Na Wang
doaj +1 more source
A (t, n) threshold protocol of semi-quantum secret sharing based on single particles
Semi-quantum secret sharing is an important research issue in quantum cryptography. In this paper, we propose a (t, n) threshold semi-quantum secret sharing protocol, which combines the practicality of semi-quantum secret sharing protocols and the ...
Ziyi Zhou +5 more
doaj +1 more source
Communication Efficient Secret Sharing [PDF]
A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the secret, and any set ...
Bruck, Jehoshua +3 more
core +4 more sources
Simple Approach to Realizing Verifiable Secret Sharing for Secure Cloud System
In $(k, n)$ threshold secret sharing, a secret is converted into $n$ shares such that any threshold $k$ or more shares allow for the reconstruction of this secret; however, the total storage cost increases.
Keiichi Iwamura +1 more
doaj +1 more source
Secret Sharing with Binary Shares
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 reveal any information about the secret and, (ii) any choice of $t+1$ shares fully reveals the secret. It is known
Lin, Fuchun +4 more
openaire +7 more sources
Ideal hierarchical secret sharing schemes [PDF]
Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays.
A. Beimel +30 more
core +1 more source
Boolean-Based (k, n, m) Multi-Secret Image Sharing
Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property.
Chien-Chang Chen +2 more
doaj +1 more source
probabilistic secret sharing [PDF]
In classical secret sharing schemes a dealer shares a secret among a set of participants in such a way that qualified subsets can reconstruct the secret, while forbidden ones do not get any kind of information about it. The basic parameter to optimize is the size of the shares, that is, the amount of secret information that the dealer has to give to ...
D’Arco, Paolo +4 more
openaire +4 more sources
Abstract Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure ...
openaire +4 more sources

