| 一个基于椭圆曲线的多重秘密共享体制 |
| |
| 引用本文： | 康斌,余昭平.一个基于椭圆曲线的多重秘密共享体制[J].计算机工程,2007,33(13):176-178. |
| |
| 作者姓名： | 康斌 余昭平 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,郑州,450004 |
| |
| 基金项目： | 国家重点实验室基金
,
国家自然科学基金 |
| |
| 摘 要： | 利用椭圆曲线提出了一种基于一般访问结构的多重秘密共享体制，可以有效阻止敌方窃取秘密或子秘密，防止内部成员之间的互相欺诈。方案中参与者的子秘钥是由各参与者选择，秘密分发者不需向各参与者传送任何秘密信息。当秘密更新、访问结构改变或参与者加入/退出系统时，成员的子秘钥无需改变。该文对体制的安全性和效率进行了分析，并与以往的方案进行了比较。
|
| 关 键 词： | 秘密共享 椭圆曲线 访问结构 欺诈 |
| 文章编号： | 1000-3428（2007）13-0176-03 |
| 修稿时间： | 2006-07-20 |
A Muti-secret Sharing Scheme Based on Elliptic Curve |
| |
| KANG Bin,YU Zhaoping.A Muti-secret Sharing Scheme Based on Elliptic Curve[J].Computer Engineering,2007,33(13):176-178. |
| |
| Authors: | KANG Bin YU Zhaoping |
| |
| Affiliation: | Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004 |
| |
| Abstract: | Based on elliptic curve, a new secret sharing scheme for general access structure is proposed. It is able to prevent adversaries from getting the secret and efficiently guard against cheating among participants. Each participant’s secret is selected by participant himself and the dealer need not deliver any secret information to each participant. The secret do not need to be changed when the shared secret is renewed, the access structure is altered, or participants added/deleted. This paper analyzes the security and efficiency of this scheme, and compares it with the scheme. |
| |
| Keywords: | secret sharing elliptic curve access structure cheat |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
