Secure publicly verifiable and proactive secret sharing schemes with general access structure

Mashhadi, Samaneh

doi:10.1016/j.ins.2016.10.040

Cited by 31 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eventually, some SSSs aim at specic goals. Proactive secret sharing schemes (PSSSs) are based on classical SSSs or VSSSs but, in addition, periodically refresh shares [51,17,92,101,7,31,62]. Refreshing consists in generating a random number at each PT's and sharing it at all other PTs' to modify existing shares.…”

Section: Secret Sharing Schemesmentioning

confidence: 99%

“…Refreshing consists in generating a random number at each PT's and sharing it at all other PTs' to modify existing shares. ln most PSSSs [51,92,7,31,62,62], refreshing is synchronous, i.e., shares cannot be reconstructed during the process, (m, t, n) MSSS type I [51]); and high communication costs for commuting PTs with each other, whose cost is at least n times that of sharing secrets. Because of these costs, and since PSSSs reuse the data sharing and reconstruction processes of the classical SSSs that are detailed in this section, we do not survey PSSSs further.…”

Section: Secret Sharing Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud technologies. Various approaches, i.e., data encryption, anonymization, replication and verification, help enforce different facets of data security. Secret sharing is a particularly interesting cryptographic technique. Its most advanced variants indeed simultaneously enforce data privacy, availability and integrity, while allowing computation on encrypted data. The aim of this paper is thus to wholly survey secret sharing schemes with respect to data security, data access and costs in the pay-as-yougo paradigm.

show abstract

Section: Secret Sharing Schemesmentioning

confidence: 99%

Section: Secret Sharing Schemesmentioning

confidence: 99%

Secret sharing for cloud data security: a survey

2017

View full text Add to dashboard Cite

show abstract

“…In the following we show how any MSP can be used to build a LMSS scheme [30, 33]. Given an MSP

false(double-struckF, M, ψ, α false)

, we can define a LMSS which tolerates the

α

‐tuple

Γ = false(Γ_{1}, \dots, Γ_{α} false)

of access structures induced by MSP.…”

Section: Preliminariesmentioning

confidence: 99%

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

2017

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…One situation is that the dealer can distribute some false shares to the participants, and the other is that malicious participants deliberately provide false shares to other participants, both of which can result in the secret being unable to be rebuilt successfully. To overcome these drawbacks, several verifiable secret sharing schemes have been proposed in [13]- [17] to resist dishonest dealer or malicious participants. These verifiable secret sharing schemes allow participants to verify correctness of the dealer's share of the distribution phase.…”

Section: Introductionmentioning

confidence: 99%

“…However, these schemes are not verifiable in some specific applications. For the schemes in [13]- [17], each participant can only verify the share they hold, but not all the shares held by other participants in the distribution phase. This makes it impossible for participants to prevent the sharing of malicious participants from being mixed in secret reconstruction process.…”

Section: Introductionmentioning

confidence: 99%

Information Privacy Protection Based on Verifiable (t, n)-Threshold Multi-Secret Sharing Scheme

2020

View full text Add to dashboard Cite

General secret sharing schemes comprise a secret dealer and a number of participants. The dealer can randomly generate a secret and then distribute shares of the secret to the participants. Verifiable multi-secret sharing enables a dealer to share multiple secrets among a group of participants such that the deceptive behaviors of the dealer and the participants can be detected. However, in the absence of secure channels, few verifiable secret sharing schemes can simultaneously share multiple secrets at one time. In this paper, we present an information privacy protection and verifiable multi-secret sharing scheme with a simple structure and high security. Each participant can verify correctness of the share distribution process based on public information published by the dealer and guarantee validity of the received share to avoid offering fake information in the process of restoring the original secret. Our performance and security analysis indicate that the newly proposed scheme is more efficient and practical while maintaining the same level of security compared with similar protocols available.

show abstract

Secure publicly verifiable and proactive secret sharing schemes with general access structure

Cited by 31 publications

References 15 publications

Secret sharing for cloud data security: a survey

Secret sharing for cloud data security: a survey

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

Information Privacy Protection Based on Verifiable (t, n)-Threshold Multi-Secret Sharing Scheme

Contact Info

Product

Resources

About