Novel and effective secret sharing scheme
A novel secret sharing scheme was proposed.This scheme consisted of two layer protocols:in the first layer,a larger secret was split into t smaller integers (sub-secrets) based on the Stern-Brocot tree; in the lower layer,t sub-secrets obtained from the first layer were regarded as t initial states...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)01-0010-07/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539947869241344 |
|---|---|
| author | Run-hua SHI Liu-sheng HUANG Wei YANG Hong ZHONG |
| author_facet | Run-hua SHI Liu-sheng HUANG Wei YANG Hong ZHONG |
| author_sort | Run-hua SHI |
| collection | DOAJ |
| description | A novel secret sharing scheme was proposed.This scheme consisted of two layer protocols:in the first layer,a larger secret was split into t smaller integers (sub-secrets) based on the Stern-Brocot tree; in the lower layer,t sub-secrets obtained from the first layer were regarded as t initial states in one-dimensional cellular automaton model,and then from the t initial states it could dynamic create all participants’ shares according to the simple fixed rule.This scheme could dynamic add new member,adjust the threshold value and renew the secret and the shares.Besides,there were still other advantages that the costs of the computation were very low and the size of the shares was very small.The results of analysis show that it was secure and very efficient. |
| format | Article |
| id | doaj-art-d9347b0c4ad54d29bb9688763143dc9e |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-d9347b0c4ad54d29bb9688763143dc9e2025-01-14T06:30:50ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-01-0133101659659271Novel and effective secret sharing schemeRun-hua SHILiu-sheng HUANGWei YANGHong ZHONGA novel secret sharing scheme was proposed.This scheme consisted of two layer protocols:in the first layer,a larger secret was split into t smaller integers (sub-secrets) based on the Stern-Brocot tree; in the lower layer,t sub-secrets obtained from the first layer were regarded as t initial states in one-dimensional cellular automaton model,and then from the t initial states it could dynamic create all participants’ shares according to the simple fixed rule.This scheme could dynamic add new member,adjust the threshold value and renew the secret and the shares.Besides,there were still other advantages that the costs of the computation were very low and the size of the shares was very small.The results of analysis show that it was secure and very efficient.http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)01-0010-07/secret sharingthresholddynamicStern-Brocot tree |
| spellingShingle | Run-hua SHI Liu-sheng HUANG Wei YANG Hong ZHONG Novel and effective secret sharing scheme Tongxin xuebao secret sharing threshold dynamic Stern-Brocot tree |
| title | Novel and effective secret sharing scheme |
| title_full | Novel and effective secret sharing scheme |
| title_fullStr | Novel and effective secret sharing scheme |
| title_full_unstemmed | Novel and effective secret sharing scheme |
| title_short | Novel and effective secret sharing scheme |
| title_sort | novel and effective secret sharing scheme |
| topic | secret sharing threshold dynamic Stern-Brocot tree |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)01-0010-07/ |
| work_keys_str_mv | AT runhuashi novelandeffectivesecretsharingscheme AT liushenghuang novelandeffectivesecretsharingscheme AT weiyang novelandeffectivesecretsharingscheme AT hongzhong novelandeffectivesecretsharingscheme |