Provably secure secret sharing scheme based on bilinear maps
|更新时间:2024-10-14
|
Provably secure secret sharing scheme based on bilinear maps
Issue 10, Pages: 45-50(2008)
作者机构:
1. 西北工业大学计算机学院
2. 西安电子科技大学计算机网络与信息安全教育部重点实验室
作者简介:
基金信息:
DOI:
CLC:TN918
Published:2008
稿件说明:
移动端阅览
LI Hui-xian1, PANG Liao-jun2. Provably secure secret sharing scheme based on bilinear maps[J]. 2008, (10): 45-50.
DOI:
LI Hui-xian1, PANG Liao-jun2. Provably secure secret sharing scheme based on bilinear maps[J]. 2008, (10): 45-50.DOI:
Provably secure secret sharing scheme based on bilinear maps
摘要
提出了利用双线性对构建可证明安全的秘密共享方案的新方法。首先
基于公钥密码体制的语义安全的标准定义
提出了适合秘密共享方案的语义安全定义。然后
提出了一个新的基于双线性对的门限秘密共享方案
并对其正确性、安全性和性能进行分析讨论和证明。相比较于现有的大多数方案
此方案是可证明安全的
同时
该方案将参与者私钥计算和秘密分发过程分离
且秘密分发者无需安全保存参与者私钥
具有更好的安全性和效率
更适合实际应用。
Abstract
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.