Multi-stage multi-secret sharing scheme for hierarchical access structure

Author(s):  
Abdul Basit ◽  
N Chaitanya Kumar ◽  
V. Ch. Venkaiah ◽  
Salman Abdul Moiz ◽  
Appala Naidu Tentu ◽  
...  
2015 ◽  
Vol 11 (1) ◽  
pp. 15 ◽  
Author(s):  
Anjaneyulu Endurthi ◽  
Oinam B. Chanu ◽  
Appala N. Tentu ◽  
V. Ch. Venkaiah

Three secret sharing schemes that use the Mignotte’ssequence and two secret sharing schemes that use the Asmuth-Bloom sequence are proposed in this paper. All these five secret sharing schemes are based on Chinese Remainder Theorem (CRT) [8]. The first scheme that uses the Mignotte’s sequence is a single secret scheme; the second one is an extension of the first one to Multi-secret sharing scheme. The third scheme is again for the case of multi-secrets but it is an improvement over the second scheme in the sense that it reduces the number of publicvalues. The first scheme that uses the Asmuth-Bloom sequence is designed for the case of a single secret and the second one is an extension of the first scheme to the case of multi-secrets. Novelty of the proposed schemes is that the shares of the participants are reusable i.e. same shares are applicable even with a new secret. Also only one share needs to be kept by each participant even for the muslti-secret sharing scheme. Further, the schemes are capable of verifying the honesty of the participants including the dealer. Correctness of the proposed schemes is discussed and show that the proposed schemes are computationally secure.


2018 ◽  
Vol 104 (1) ◽  
pp. 491-503 ◽  
Author(s):  
Massoud Hadian Dehkordi ◽  
Samaneh Mashhadi ◽  
Hossein Oraei

2021 ◽  
Vol 50 (2) ◽  
pp. 236-246
Author(s):  
Guoai Xu ◽  
Jiangtao Yuan ◽  
Guosheng Xu ◽  
Xingxing Jia

Multi-stage secret sharing scheme is practical in the case that there is a security system with m ordered checkpoints.It is natural to divide the m checkpoints into m different levels. There are m different secrets, and eachof them with a different importance corresponds to a checkpoint/level. The participants are also divided intom disjoint levels as they do in the hierarchical threshold access structure. Hierarchical threshold access structurewith the existential quantifier ( HTAS∃ ) does not cover the common practice that at least a few numbersof high-ranking participants are required to be involved in any recovery of the secret. The popular schemeswith hierarchical access structure were needed to check many matrices for non-singularity. We propose amulti-stage secret sharing scheme for HTAS∃ , and the tools are based on the linear homogeneous recurrencerelations (LHRRs) and one-way functions. We give the HTAS∃ a modification, so that this hierarchical accessstructure can satisfy the common practice. In our scheme, if the participants are divided into m levels, thereusually has m secrets. But before the (j − 1)-th secret is recovered, the j-th secret cannot be recovered. Ourscheme is a computational secure. The proposed scheme requires a share for each participant and the shareis as long as each secret. Our scheme has high efficiency by comparing with the state-of-the-art hierarchicalsecret sharing schemes.


Sign in / Sign up

Export Citation Format

Share Document