A secret sharing scheme based on Near-MDS codes

Zhou, Yousheng; Wang, Feng; Yang, Xin; Si, Luo; Qing, Sihan; Yang, Yixian

doi:10.1109/icnidc.2009.5360821

Cited by 21 publications

(16 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…. , R ′ 5 are found to be (2, 7), (10, 2), (5, 2), (2, 4), (7,9) and (8,8), respectively. Now, since m ≤ n, the polynomial g(x) will be of order 6 [which is n + m − 1 as in (3)] and is given as below…”

Section: Numerical Examplementioning

confidence: 94%

“…when the number of secrets is less than the threshold), there will be 2n + 1 public values in Hadian and Mashhadi's scheme. We (5,2), (8,3), (10,2), (3,6), (7,9), (7,2), (3,5), (10,9), (8,8), (5,9), (2,4), (0, 0)}…”

Section: Critical Comparison Of Schemesmentioning

confidence: 99%

“…[7] presented a ( t , n ) threshold secret sharing method which was similar to Yang et al .’s in efficiency but required as many public values as Chien et al .’s did. Over the last few years, the research trend has been towards reduction of computational complexity as well as number of required public values [8].…”

Section: Related Workmentioning

confidence: 99%

“…This method of cryptography has many applications in the protection of secure information against loss, destruction and theft [1, 2]. One of the famous members of this family is ( t , n ) threshold secret sharing [3–9]. In this method, t or more participants who pool their shares can reconstruct the secret(s), but any subset with less than t participants cannot.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Dynamic and verifiable multi‐secret sharing scheme based on Hermite interpolation and bilinear maps

Tadayon

Khanmohammadi

Haghighi

2015

IET Information Security

View full text Add to dashboard Cite

t, n) threshold secret sharing is a cryptographic mechanism to divide and disseminate information among n participants in a way that at least t(t ≤ n) of them should be present for the original data to be retrieved. This has practical applications in the protection of secure information against loss, destruction and theft. In this study, the authors propose a new multi-secret sharing scheme which is based on Hermite interpolation polynomials. Using the properties of discrete logarithm over elliptic curves and bilinear maps, they have created a verifiable scheme in which there is no need for a secure channel and every participant chooses their own share. This feature does not let the dealer cheat. The proposed method is dynamic to the changes in the number and value of the secrets as well as the threshold. In addition, it has the multi-use property which reduces the cost of secret distribution in multiple rounds of operation. The public values used in the proposed scheme are less than those of schemes providing similar features and the computations are also less complex. At the end of this study, they have compared the author's scheme with the similar ones against a comprehensive set of key features used in secret sharing.

show abstract

Section: Numerical Examplementioning

confidence: 94%

Section: Critical Comparison Of Schemesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic and verifiable multi‐secret sharing scheme based on Hermite interpolation and bilinear maps

Tadayon

Khanmohammadi

Haghighi

2015

IET Information Security

View full text Add to dashboard Cite

show abstract

“…We can similarly design a scheme as in [13] and [19] by using free MDR codes and free near-MDR codes, and then obtain by using Corollary 1 that this scheme is both perfect (k + 1, n)-threshold and ideal, furthermore, we can similarly give the characterization of cheating detection and cheater identification of the scheme (see [13] and [19] for details).…”

Section: The Weight Distribution Of a Free Near-mdr Codementioning

confidence: 99%

Higher weights and near-MDR codes over chain rings

Liu¹,

Da-jian²

2018

Advances in Mathematics of Communications

View full text Add to dashboard Cite

The matrix description of a near-MDR code is given, and some judging criterions are presented for near-MDR codes. We also give the weight distribution of a near-MDR code and the applications of a near-MDR code to secret sharing schemes. Furthermore, we will introduce the chain condition for free codes over finite chain rings, and then present a formula for computing higher weights of tensor product of free codes satisfying the chain condition. We will also find a chain for any near-MDR code, and thus show that any near-MDR code satisfies the chain condition.

show abstract