(t, n) threshold secret sharing scheme without SDC
By means of the intractability of ellipse curve discrete logarithm problem（ECDLP）,a（t,n） secret sharing threshold scheme based on ellipse curve cryptography was proposed.Generally speaking,there are two kinds of threshold schemes: a threshold scheme with share distribution center（SDC） and a threshol...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2006-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74665082/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | By means of the intractability of ellipse curve discrete logarithm problem（ECDLP）,a（t,n） secret sharing threshold scheme based on ellipse curve cryptography was proposed.Generally speaking,there are two kinds of threshold schemes: a threshold scheme with share distribution center（SDC） and a threshold scheme without SDC.Under distrib-uted situation,there is no such a center can be completely trusted by all members of the group,a threshold scheme with-out SDC appears more attractive.In the scheme without SDC all of the members generate the group public key and pri-vate keys.When new numbers join the group secret sharing should be updated by period.An example of the scheme us-ing the small number was given.The security of the scheme was analyzed in the final. |
|---|---|
| ISSN: | 1000-436X |