| 注册
首页|期刊导航|计算机工程|基于理想格的可证明安全数字签名方案

基于理想格的可证明安全数字签名方案

冯超逸 赵一鸣

计算机工程2017,Vol.43Issue(5):103-107,5.
计算机工程2017,Vol.43Issue(5):103-107,5.DOI:10.3969/j.issn.1000-3428.2017.05.017

基于理想格的可证明安全数字签名方案

Ideal Lattice Based Justifiable Secure Digital Signature Scheme

冯超逸 1赵一鸣1

作者信息

  • 1. 复旦大学软件学院,上海201203
  • 折叠

摘要

Abstract

In order to guarantee the security of signature scheme under quantum attack,most of the existing lattice-based signature schemes are based on the difficulty hypothesis under general lattice rather than ideal lattice,and it caused lower efficiency of these schemes.To overcome the problem,a new digital signature scheme based on ideal lattice is proposed.By reducing the problem to the PLWE,it is proved that an attacker can not forge a legitimate signature for a new message even if he gets multiple existing messages and the corresponding signature.Analysis result shows that the signature length and the key length of the scheme are reduced by O (n),compared with the existing digital signature scheme based on general lattice.

关键词

/数字签名/陷门/多项式环/安全性分析

Key words

lattice/digital signature/trapdoor/polynomial ring/security analysis

分类

信息技术与安全科学

引用本文复制引用

冯超逸,赵一鸣..基于理想格的可证明安全数字签名方案[J].计算机工程,2017,43(5):103-107,5.

计算机工程

OA北大核心CSCDCSTPCD

1000-3428

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