| 注册
首页|期刊导航|计算机与数字工程|基于ECC双重更新的多秘密共享方案

基于ECC双重更新的多秘密共享方案

王建东 邹惠

计算机与数字工程2011,Vol.39Issue(4):94-97,4.
计算机与数字工程2011,Vol.39Issue(4):94-97,4.

基于ECC双重更新的多秘密共享方案

A Multi-Secret Sharing Scheme with Double Renewing Based on ECC

王建东 1邹惠1

作者信息

  • 1. 石家庄经济学院信息工程学院,石家庄050031
  • 折叠

摘要

Abstract

In multi-secret sharing schemes, the shares have a long utilization period. By means of the intractability of ellipse curve discrete logarithm problem, a multi-secret sharing scheme with double renewing is proposed. In the scheme, the shares can be repeatedly used for the reconstruction of multiple secrets, the share of every participant can be renewed periodically, the shares which are betrayed can be renewed instantly. Besides, the efficiency of the scheme is discussed.

关键词

多秘密共享/定期更新/即时更新/动态安全

Key words

multi-secret sharing/ periodic renewing/ instant renewing/ proactive security

分类

信息技术与安全科学

引用本文复制引用

王建东,邹惠..基于ECC双重更新的多秘密共享方案[J].计算机与数字工程,2011,39(4):94-97,4.

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文