A Multi-Stage Secret Sharing Scheme with General Access Structures

Wang, Yun; Zhong, Pucha; Xiong, Guohua

doi:10.1109/wicom.2008.2939

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme proposed in has low computation complexity, but it cannot verify the secret shares. Wei et al proposed a scheme, which is also based on Lagrange interpolation polynomial. It also allows new secrets to be added, and the access structure can be changed dynamically.…”

Section: Analysis and Discussionmentioning

confidence: 99%

An extensible cheat‐proofing multi‐secret sharing scheme with low computation complexity

Yue

Huang

Xiao

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

Secret sharing schemes are widely applied in various areas, and there are series of achievements, among which the verifiable multi-secret schemes are the most representative ones. A few verifiable multi-secret schemes own the following drawbacks: insensitive to the differences of security levels, lack of expandability, high computation complexity of verification process, and low efficiency of execution. Addressing the issues, an extensible cheat-proofing multi-secret sharing scheme with low computation complexity is proposed. With the security of RSA public key system and discrete logarithm puzzle, the proposed scheme can realize the following functions: first, the secret dealer can set relatively threshold values according to different security levels; second, the participants and secret combiner can verify the secret shares, which can guard against cheating problem, resist various kinds of attacks and improve the success rate of secret reconstruction; in addition, the secret shares are reusable in the situations of new group secret and new participant joining the group, which brings about good expandability. Moreover, compared with the previous schemes, the proposed scheme reduces the information content published by secret dealer and brings down the computation complexity of verification, which makes the efficiency of the scheme greatly improved.

show abstract

Section: Analysis and Discussionmentioning

confidence: 99%

An extensible cheat‐proofing multi‐secret sharing scheme with low computation complexity

Yue

Huang

Xiao

et al. 2013

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…Keeping these issues in mind, the idea of computationally secure secret sharing schemes and robust secret sharing schemes came into existence with various proposals [1,4,5,7,9,12,15,17,20,21]. In 1994, He-Dawson [9] proposed a multi-stage (t, n) threshold secret sharing scheme.…”

Section: Related Workmentioning

confidence: 99%

“…In 2006, Pang et al [15] proposed a multi-secret sharing scheme for general access structure in which all the secrets are revealed at a time. In 2008, Wei et al [21] proposed a renewable secret sharing scheme for general access structure, but the secrets are to be revealed in a pre-determined order. Recently, in [20], Shao proposed a threshold multi-secret sharing scheme using hash function which also suffers the drawback of revealing all the secrets at a time as in [15].…”

Section: Related Workmentioning

confidence: 99%

Computationally Secure Robust Multi-secret Sharing for General Access Structure

Das

Roy

Adhikari

2015

Springer Proceedings in Mathematics &Amp; Statistics

View full text Add to dashboard Cite

Secret sharing scheme plays a crucial role in distributed cryptosystems. Due to its extensive use in numerous applications, an important goal in this area is to minimize trust among the participants. To remove this bottleneck, robust secret sharing, which allows the correct secret to be recovered even when some of the shares presented during an attempted reconstruction are incorrect, can be an efficient tool. However, as unconditional security demands honest majority and share size to be at least equal to the size of the secret, the need for computational security of such schemes has been felt over the years, specially in case of multi-secret sharing schemes. In this paper, we provide a notion of computationally robust multi-secret sharing scheme for general access structure. We also propose a robust multi-secret sharing scheme for general access structure and prove its computational security under the proposed notation.

show abstract

Source-Location Privacy Protection Based on Anonymity Cloud in Wireless Sensor Networks

Wang

et al. 2020

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

A Multi-Stage Secret Sharing Scheme with General Access Structures

Cited by 4 publications

References 9 publications

An extensible cheat‐proofing multi‐secret sharing scheme with low computation complexity

An extensible cheat‐proofing multi‐secret sharing scheme with low computation complexity

Computationally Secure Robust Multi-secret Sharing for General Access Structure

Source-Location Privacy Protection Based on Anonymity Cloud in Wireless Sensor Networks

Contact Info

Product

Resources

About