Name
Abstract | ||
|---|---|---|
A (t,n)-threshold scheme with secure secret reconstruction, or a (t,n)-SSR scheme for short, is a (t,n)-threshold scheme against the outside adversary who has no valid share, but can impersonate a participant to take part in the secret reconstruction phase. We point out that previous bivariate polynomial-based (t,n)-SSR schemes, such as those of Harn et al. (Information Sciences 2020), are insecure, which is because the outside adversary may obtain the secret by solving a system of t(t+1)2-ary linear equations. We revise Harn et al. scheme and get a secure (t,n)-SSR scheme based on a symmetric bivariate polynomial for the first time, where t⩽n⩽2t-1. To increase the range of n for a given t, we construct a secure (t,n)-SSR scheme based on an asymmetric bivariate polynomial for the first time, where n⩾t. We find that the share sizes of our schemes are the same or almost the same as other existing insecure (t,n)-SSR schemes based on bivariate polynomials. Moreover, our asymmetric bivariate polynomial-based (t,n)-SSR scheme is more easy to be constructed compared to the Chinese Remainder Theorem-based (t,n)-SSR scheme with the stringent condition on moduli, and their share sizes are almost the same. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ins.2022.02.005 | Information Sciences |
Keywords | DocType | Volume |
Secret sharing,Secure secret reconstruction,Bivariate polynomial,Threshold changeable secret sharing | Journal | 593 |
ISSN | Citations | PageRank |
0020-0255 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Ding | 1 | 0 | 0.34 |
| Pinhui Ke | 2 | 3 | 2.77 |
| Changlu Lin | 3 | 10 | 2.22 |
| Huaxiong Wang | 4 | 1701 | 142.11 |