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 phase...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2019-02-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2019003 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 phase can not prevent external attackers from knowing the secret,while internal attackers can release a fake share to deceive honest participants during the secret reconstruction process.A rational threshold secret sharing scheme using asymmetric bivariate polynomial with unknown rounds is proposed.Then it shows its fairness and security against non-cooperative attack with synchronization,non-cooperative attack with a synchronization,cooperative attack with synchronization and cooperative attack with a synchronization. |
|---|---|
| ISSN: | 2096-109X |