Fair secret sharing scheme using asymmetric bivariate polynomial
In Shamir's （t,n） secret sharing scheme, any m（m≥t） participants can reconstruct the secret, and any less than t participants can't get any information about the secret. However, if there are more than t participants in the secret reconstruction phase, Shamir's secret reconstruction...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2019-02-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.infocomm-journal.com/cjnis/CN/10.11959/j.issn.2096-109x.2019003 |