Name
Abstract | ||
|---|---|---|
Multi-secret sharing scheme has been well studied in recent years. In most multi-secret sharing schemes, all secrets must be recovered synchronously; the shares cannot be reused any more. In 2017, Harn and Hsu proposed a novel and reasonable feature in multiple secret sharing, such that the multiple secrets should be reconstructed asynchronously and the recovering of previous secrets do not leak any information on unrecovered secrets. Harn and Hsu also proposed a (t,n) multi-secret sharing scheme that satisfies this feature. However, the analysis on Harn-Hsu’s scheme is wrong, and their scheme fails to satisfy this feature. If one secret is reconstructed, all the other unrecovered secrets can be computed by any t − 1 shareholders illegitimately. Another problem in Harn-Hsu’s work is that the parameters are unreasonable which will be shown as follows. In this paper, we prove the incorrectness of Harn-Hsu’s scheme and propose a new (t,n) multi-secret sharing scheme which is extended from Harn-Hsu’s scheme; our proposed scheme satisfies the feature introduced by Harn and Hsu. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1186/s13638-018-1086-5 | EURASIP Journal on Wireless Communications and Networking |
Keywords | Field | DocType |
Secret sharing scheme,Multiple secrets,Asynchronous,Bivariate polynomial | Asynchronous communication,Secret sharing,Computer science,Computer network,Theoretical computer science,Bivariate polynomials | Journal |
Volume | Issue | ISSN |
2018 | 1 | 1687-1499 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tong Zhang | 1 | 53 | 18.56 |
| Xizheng Ke | 2 | 27 | 3.56 |
| Yan-Xiao Liu | 3 | 67 | 8.68 |