scholarly journals Secure secret reconstruction and multi-secret sharing schemes with unconditional security

2013 ◽  
Vol 7 (3) ◽  
pp. 567-573 ◽  
Author(s):  
Lein Harn
Keyword(s):  
Secret Sharing ◽  
Unconditional Security ◽  
Secret Sharing Schemes ◽  
Multi Secret Sharing ◽  
Secret Reconstruction

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
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Multi Secret Sharing

scholarly journals A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 70666-70673 ◽  
Author(s):  
Changlu Lin ◽  
Huidan Hu ◽  
Chin-Chen Chang ◽  
Shaohua Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Multi Secret Sharing ◽  
Secret Reconstruction

Ramp secret sharing with cheater identification in presence of rushing cheaters

2019 ◽  
Vol 11 (2) ◽  
pp. 103-113
Author(s):  
Jyotirmoy Pramanik ◽  
Avishek Adhikari
Keyword(s):  
Secret Sharing ◽  
Private Information ◽  
Information Storage ◽  
Small Positive Number ◽  
Secret Sharing Schemes ◽  
Security Model ◽  
Image Sharing ◽  
Secure Information ◽  
Unlimited Time ◽  
Secret Reconstruction

Abstract Secret sharing allows one to share a piece of information among n participants in a way that only qualified subsets of participants can recover the secret whereas others cannot. Some of these participants involved may, however, want to forge their shares of the secret(s) in order to cheat other participants. Various cheater identifiable techniques have been devised in order to identify such cheaters in secret sharing schemes. On the other hand, Ramp secret sharing schemes are a practically efficient variant of usual secret sharing schemes with reduced share size and some loss in security. Ramp secret sharing schemes have many applications in secure information storage, information-theoretic private information retrieval and secret image sharing due to producing relatively smaller shares. However, to the best of our knowledge, there does not exist any cheater identifiable ramp secret sharing scheme. In this paper we define the security model for cheater identifiable ramp secret sharing schemes and provide two constructions for cheater identifiable ramp secret sharing schemes. In addition, the second construction is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round. Also, we do not make any computational assumptions for the cheaters, i.e., cheaters may be equipped with unlimited time and resources, yet, the cheating probability would be bounded above by a very small positive number.

CRT based multi-secret sharing schemes: revisited

2018 ◽  
Vol 13 (1) ◽  
pp. 1 ◽  
Author(s):  
Appala Naidu Tentu ◽  
V.Ch. Venkaiah ◽  
V. Kamakshi Prasad
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Multi Secret Sharing

scholarly journals Multi-Secret Sharing Schemes

1994 ◽  
pp. 150-163 ◽  
Author(s):  
Carlo Blundo ◽  
Alfredo De Santis ◽  
Giovanni Di Crescenzo ◽  
Antonio Giorgio Gaggia ◽  
Ugo Vaccaro
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Multi Secret Sharing

scholarly journals Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT

2015 ◽  
Vol 11 (1) ◽  
pp. 15 ◽  
Author(s):  
Anjaneyulu Endurthi ◽  
Oinam B. Chanu ◽  
Appala N. Tentu ◽  
V. Ch. Venkaiah
Keyword(s):  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
The Third ◽  
Sharing Scheme ◽  
Multi Stage ◽  
Multi Secret Sharing

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.

scholarly journals A SECRET SHARING SCHEME BASED ON MULTIVARIATE POLYNOMIALS

2019 ◽  
Vol 2 (2) ◽  
pp. 81
Author(s):  
Ari Dwi Hartanto ◽  
Sutjijana Sutjijana
Keyword(s):  
Secret Sharing ◽  
Lagrange Interpolation ◽  
Partial Information ◽  
Interpolation Formula ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Multivariate Polynomials ◽  
Reconstruction Process ◽  
Sharing Scheme ◽  
Secret Reconstruction

A Secret sharing scheme is a method for dividing a secret into several partialinformation. The secret can be reconstructed if a certain number of partial information is collected. One of the known secret sharing schemes is the Shamir’s secret sharing scheme. It uses Lagrange interpolation (with one indeterminate) for reconstructing the secret. In this paper, we present a secret sharing scheme using multivariate polynomials with the secret reconstruction process using the multivariate interpolation formula derived by Saniee (2007). The resulted scheme can be considered as a generalization of the Shamir’s secret sharing scheme.

Sign in / Sign up

Export Citation Format

Share Document