Provably secure secret sharing scheme based on bilinear maps
A method to construct provable secure secret sharing scheme using bilinear pairing was recommended.Firstly,the semantic security definition for secret sharing scheme is given,which is developed from the standard definition of semantic security for the public key cryptosystems.Then,a new secret shari...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2008-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74656483/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A method to construct provable secure secret sharing scheme using bilinear pairing was recommended.Firstly,the semantic security definition for secret sharing scheme is given,which is developed from the standard definition of semantic security for the public key cryptosystems.Then,a new secret sharing scheme based on the bilinear maps is pro-posed,with its correctness,security and performance analyzed and proven subsequently.Compared with the existing schemes,the proposed scheme is provably secure.At the same time,the proposed scheme departs the private key compu-tation of participants from the secret distribution process and the dealer does not have to securely save each participant’s private key,which makes this scheme more secure and more efficient.Therefore,the proposed scheme is more applicable than the existing ones. |
|---|---|
| ISSN: | 1000-436X |