scholarly journals Optimal Improvement Ratios of Multi-Secret Sharing Schemes Can Be Achieved

2016 ◽  
Vol 71 ◽  
pp. 01003
Author(s):  
Justie Su-Tzu Juan ◽  
Jennifer Hui-Chan Tsai ◽  
Yi-Chun Wang
2018 ◽  
Vol 13 (1) ◽  
pp. 1 ◽  
Author(s):  
Appala Naidu Tentu ◽  
V.Ch. Venkaiah ◽  
V. Kamakshi Prasad

Author(s):  
Carlo Blundo ◽  
Alfredo De Santis ◽  
Giovanni Di Crescenzo ◽  
Antonio Giorgio Gaggia ◽  
Ugo Vaccaro

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.


2006 ◽  
Vol 12 (4) ◽  
pp. 704-713 ◽  
Author(s):  
Mulan Liu ◽  
Liangliang Xiao ◽  
Zhifang Zhang

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1582
Author(s):  
Hongliang Cai ◽  
Dan Tang

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.


Sign in / Sign up

Export Citation Format

Share Document