| 注册
首页|期刊导航|计算机工程|基于椭圆曲线的门限共享解签密改进方案

基于椭圆曲线的门限共享解签密改进方案

周宣武 刘开华 金志刚 古俊科 李欣 付燕

计算机工程Issue(12):121-125,5.
计算机工程Issue(12):121-125,5.DOI:10.3969/j.issn.1000-3428.2014.12.022

基于椭圆曲线的门限共享解签密改进方案

Improved Threshold Shared Unsigncryption Scheme Based on Elliptic Curve

周宣武 1刘开华 2金志刚 1古俊科 1李欣 3付燕3

作者信息

  • 1. 天津大学电子信息工程学院,天津300072
  • 2. 武警指挥学院,天津300250
  • 3. 武警指挥学院,天津300250
  • 折叠

摘要

Abstract

This paper analyzes the threshold signcryption scheme of Chen et al ( Microcomputer Information,2005, No. 11),and proposes its attack algorithm. Then it presents an efficient threshold unsigncryption scheme with forward security based on elliptic curve and analyzes the confidentiality,unforgeability,non-repudiation and additional properties of the scheme,including perfect secret sharing,coalition attack resistance and forward security. Analysis result shows that the improved threshold unsigncryption scheme achieves high efficiency regarding practical application with its much lower cost of computation and communication and shorter signcryption text than the scheme by Chen et al.

关键词

门限解签密/Gost数字签名/前向安全性/门限完备性/合谋攻击/效率分析

Key words

threshold unsigncryption/Gost digital signature/forward security/threshold completeness/coalition attack/efficiency analysis

分类

信息技术与安全科学

引用本文复制引用

周宣武,刘开华,金志刚,古俊科,李欣,付燕..基于椭圆曲线的门限共享解签密改进方案[J].计算机工程,2014,(12):121-125,5.

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

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