计算机工程

• 安全技术 • 上一篇    下一篇

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

冯超逸,赵一鸣   

  1. (复旦大学 软件学院,上海 201203)
  • 收稿日期:2016-05-23 出版日期:2017-05-15 发布日期:2017-05-15
  • 作者简介:冯超逸(1993—),男,硕士研究生,主研方向为密码学、信息安全;赵一鸣,副教授。

Ideal Lattice Based Justifiable Secure Digital Signature Scheme

FENG Chaoyi,ZHAO Yiming   

  1. (Software School,Fudan University,Shanghai 201203,China)
  • Received:2016-05-23 Online:2017-05-15 Published:2017-05-15

摘要: 为确保签名算法在量子攻击下的安全性,现有的基于格的签名方案大部分都采用标准格结构下的困难性假设问题,而不是理想格,造成方案效率较低。为此,提出一种新的基于理想格上PLWE问题的数字签名方案。通过归约到PLWE问题,证明攻击者即使获取多个已有的消息和对应的签名,也无法对一个新的消息伪造出合法的签名。分析结果表明,与现有的基于标准格上陷门的数字签名方案相比,该方案的签名长度和公私钥长度均减少了约O(n)。

关键词: 格, 数字签名, 陷门, 多项式环, 安全性分析

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

中图分类号: