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: | LI Hui-xian1, PANG Liao-jun2 |
---|---|
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!
|
Similar Items
-
Constant-round fair rational secret sharing scheme
by: Meng-hui LI, et al.
Published: (2017-01-01) -
Efficiency identity-based threshold group signature scheme
by: LIU Hong-wei 1, et al.
Published: (2009-01-01) -
(t, n) threshold secret sharing scheme without SDC
by: ZHOU Fu-cai, et al.
Published: (2006-01-01) -
Provably secure social network privacy-preserving scheme
by: Jian-qiong HE, et al.
Published: (2016-08-01) -
Certificateless signature scheme without bilinear pairings
by: Sheng-bao WANG, et al.
Published: (2012-04-01)