首页 | 官方网站   微博 | 高级检索  
     

基于ECC的可验证多秘密共享方案
引用本文:张建中,兰建青.基于ECC的可验证多秘密共享方案[J].计算机工程,2010,36(17):167-168,172.
作者姓名:张建中  兰建青
作者单位:陕西师范大学数学与信息科学学院,西安,710062
基金项目:国家自然科学基金,陕西省自然科学基金,陕西省教育厅科学研究计划基金 
摘    要:在现有方案中,各参与者的子秘密由分发者选取,需要通过安全信道发送给各参与者,在秘密恢复时不具有可验证性。针对该问题,提出一种基于ECC的可验证多秘密共享方案。参与者的子秘密由各参与者自己选取,并且可以多次使用。分发者和参与者间不需要安全信道。在秘密恢复时,可以验证各参与者是否进行欺诈,并且一次可以共享多个秘密。

关 键 词:椭圆曲线  自配对  可验证

Verifiable Multi-secret Sharing Scheme Based on ECC
ZHANG Jian-zhong,LAN Jian-qing.Verifiable Multi-secret Sharing Scheme Based on ECC[J].Computer Engineering,2010,36(17):167-168,172.
Authors:ZHANG Jian-zhong  LAN Jian-qing
Affiliation:(College of Mathematics and Information Science, Shaanxi Normal University, Xi'an 710062)
Abstract:In existing scheme, the dealer chooses and delivers secret information to every participant, so a secure channel between them is necessary, and in the recovery phase, the scheme can not check whether every participant provides the true information. Aiming at such shortcomings, the paper proposes a verifiable multi-secret sharing scheme based on ECC. Each participant's secret shadow is selected and kept by the participant himself. The shadows do not need to be changed when the shared secret is renewed, and many secrets can be recovered one time. The scheme can check whether each participant provides the true information, so a secure channel between them is unnecessary.
Keywords:elliptic curve  self-pairing  verifiable
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号