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...

Full description

Saved in:
Bibliographic Details
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!
_version_ 1841537518923677696
author LI Hui-xian1
PANG Liao-jun2
author_facet LI Hui-xian1
PANG Liao-jun2
author_sort LI Hui-xian1
collection DOAJ
description 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.
format Article
id doaj-art-202598898a744831b7016d5ce6cf3888
institution Kabale University
issn 1000-436X
language zho
publishDate 2008-01-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-202598898a744831b7016d5ce6cf38882025-01-14T08:32:23ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2008-01-01455074656483Provably secure secret sharing scheme based on bilinear mapsLI Hui-xian1PANG Liao-jun2A 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.http://www.joconline.com.cn/zh/article/74656483/secret sharingthreshold schemebilinear pairingprovably secure
spellingShingle LI Hui-xian1
PANG Liao-jun2
Provably secure secret sharing scheme based on bilinear maps
Tongxin xuebao
secret sharing
threshold scheme
bilinear pairing
provably secure
title Provably secure secret sharing scheme based on bilinear maps
title_full Provably secure secret sharing scheme based on bilinear maps
title_fullStr Provably secure secret sharing scheme based on bilinear maps
title_full_unstemmed Provably secure secret sharing scheme based on bilinear maps
title_short Provably secure secret sharing scheme based on bilinear maps
title_sort provably secure secret sharing scheme based on bilinear maps
topic secret sharing
threshold scheme
bilinear pairing
provably secure
url http://www.joconline.com.cn/zh/article/74656483/
work_keys_str_mv AT lihuixian1 provablysecuresecretsharingschemebasedonbilinearmaps
AT pangliaojun2 provablysecuresecretsharingschemebasedonbilinearmaps