| 一种双重更新秘密共享方案 |
| |
| 引用本文： | 邹惠,王建东,刘永伟,刘振勇. 一种双重更新秘密共享方案[J]. 计算机工程, 2006, 32(12): 163-165 |
| |
| 作者姓名： | 邹惠 王建东 刘永伟 刘振勇 |
| |
| 作者单位： | 石家庄经济学院信息工程学院,石家庄,050031 |
| |
| 摘 要： | 利用椭圆曲线离散对数问题的难解性，给出了一种新的双重更新秘密共享方案。该方案在保持共享秘密不变的情况下，能由更新中心独立于分发中心定期对子秘密进行更新，同时对处于更新周期内泄漏或有泄漏嫌疑的子秘密，由分发中心进行即时更新。双重更新有利于提高系统的安全性；独立于分发中心进行定期更新，则有利于减少分发中心的工作量。
|
| 关 键 词： | 秘密共享 定期更新 即时更新 椭圆曲线离散对数 |
| 文章编号： | 1000-3428（2006）12-0163-03 |
| 收稿时间： | 2006-01-12 |
| 修稿时间： | 2006-01-12 |
A New Secret Sharing Scheme with Double Renewing |
| |
| ZOU Hui,WANG Jiandong,LIU Yongwei,LIU Zhenyong. A New Secret Sharing Scheme with Double Renewing[J]. Computer Engineering, 2006, 32(12): 163-165 |
| |
| Authors: | ZOU Hui WANG Jiandong LIU Yongwei LIU Zhenyong |
| |
| Affiliation: | School of Information Engieering, Shijiazhuang University of Economics, Shijiazhuang 050031 |
| |
| Abstract: | By means of the intractability of ellipse curve discrete logarithm problem, a new secret sharing threshold scheme with double renewing is presented. This scheme can renew sub-share periodically without changing the shared-secret independently, at the same time, distribution center can renew insecure sub-share instantly. Because the sub-share is renewed doubly, the security is improved. Because the sub-share is renewed periodically by update center, amounts of calculation time are reduced. |
| |
| Keywords: | Secret sharing Periodic renewing Instant renewing Ellipse curve discrete logarithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
