Provably secure verifiable multi‐stage secret sharing scheme based on monotone span program

Abstract

In multi-secret sharing (MSS) scheme, a dealer distributes multiple secrets among a set of participants, each of them according to an access structure. In this study, the authors propose a novel linear MSS with computational verifiability that provide many functions for practical applications in comparison with the previous works focusing on MSS schemes in the general scenario. This scheme has the same advantages as previous schemes; moreover, it is verifiable and multi-use secret sharing. Furthermore, in this scheme the secret reconstruction is according to the dealer's preassigned order. Also, they prove the security of the authors' scheme in the standard model.

LWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)

“…To share multiple secrets among participants, a dealer employs a multi‐secret sharing $$( {{\mathrm{MSS}}} )$$ scheme [14–22]. $${\mathrm{MSS}}$$ schemes can be categorized into two types based on secret reconstruction: multi‐stage secret sharing $$( {{\mathrm{MSSS}}} )$$ and general MSS $$( {{\mathrm{GMSS}}} )$$.…”

“…To share multiple secrets among participants, a dealer employs a multi-secret sharing (MSS) scheme [14][15][16][17][18][19][20][21][22]. MSS schemes can be categorized into two types based on secret reconstruction: multi-stage secret sharing (MSSS) and general MSS (GMSS).…”

An Efficient Simulation of Quantum Secret Sharing

“…A dealer shares a secret with n players in secret sharing (SS), and when the secret needs to be reconstructed, the threshold number of players can do so collaboratively. The quantum secret sharing [15,1,74,5,20,18,14,27,11,36,28,26,34,32,29,17,4,33,44,41,48,13,62] is a fundamental primitive protocol for sharing a secret in quantum cryptography, which may be considered as an extension of secret sharing. The QSS protocol can be used to create complex multiparty quantum computing protocols that are secure.…”

A Fair (t, n)-Threshold Secret Sharing Scheme with Efficient Cheater Identifying

“…With the same purpose, in 2018 Liu [13] proposed a (t, n)-threshold secret image sharing scheme. In order to improve the efficiency of the verifiable secret sharing scheme, Mashhadi [14] and Cafaro [15] put forward their schemes respectively, but none of their schemes are unconditionally safe. In 2018, Liu and Yang [17] proposed a cheating identifiable secret sharing scheme by using the symmetric bivariate polynomial, but the scheme does not achieve fairness requirement of secret sharing.…”