信息网络安全 ›› 2017, Vol. 17 ›› Issue (10): 36-41.doi: 10.3969/j.issn.1671-1122.2017.10.006

• • 上一篇    下一篇

抗量子攻击的高效盲签名方案

陈莉1(), 顾纯祥2,3, 尚明君4   

  1. 1.河南财经政法大学网络信息安全研究所, 河南郑州 450046
    2. 解放军信息工程大学,河南郑州 450002
    3. 数学工程与先进计算国家重点实验室,江苏无锡 214125
    4.国防大学联合勤务学院,北京100036
  • 收稿日期:2017-08-10 出版日期:2017-10-10 发布日期:2020-05-12
  • 作者简介:

    作者简介: 陈莉(1968—),女,江苏,教授,博士,主要研究方向为网络信息安全理论与技术;顾纯祥(1976—),男,安徽,教授,博士,主要研究方向为密码学、网络与信息安全;尚明君(1988—),男,山东,硕士研究生,主要研究方向为教育训练技术。

  • 基金资助:
    国家自然科学基金[61170234,61309007,61502533];河南省高校科技创新人才支持计划[13HASTIT043]

Efficient Blind Signature Scheme of Anti-Quantum Attacks

Li CHEN1(), Chunxiang GU2,3, Mingjun SHANG4   

  1. 1.Institute of Network Information Security, Henan University of Economics and Law, Zhengzhou Henan 450046, China
    2. PLA Information Engineering University, Zhengzhou Henan 450002, China
    3. State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi Jiangsu 214125, China
    4. Joint Service Academy of National Defense University, Beijing 100036, China
  • Received:2017-08-10 Online:2017-10-10 Published:2020-05-12

摘要:

盲签名方案已在电子现金、电子选举、不经意传输等领域得到广泛应用。基于数论假设(大整数分解问题和离散对数问题)的盲签名方案存在不能抵抗量子攻击和亚指数攻击问题,基于传统证书的格上盲签名方案存在需要耗费巨大存储开销和通信代价的问题。针对上述问题,文章结合基于格的密码体制和基于身份的密码体制的优势,提出了一种高效、可抵抗量子算法攻击的盲签名方案,并在随机喻示模型下,基于格上小整数解(SIS)问题的困难性假设,证明了新方案的安全性。新方案使用固定维数的格基委托算法生成用户的私钥,实现了短私钥和短签名的目标。

关键词: 格密码, 盲签名, 抗量子攻击, 小整数解

Abstract:

Blind signature schemes have been widely used in areas such as e-cash, e-voting, oblivious transfer, etc. Blind signature schemes based on the number theory assumptions, such as big integer factorization problem (IFP) and discrete logarithm problem (DLP), could not resist the cryptanalysis by quantum attacksand sub-exponent algorithms, and lattice-based blind signature schemes based on traditional certificate had the problems of huge storage overhead and communication cost. Aiming at above problems, based on the advantages of lattice-based cryptosystem and identity-based cryptosystem, this paper proposes a blind signature scheme with high efficiency and quantum-resistant attacks. The scheme is proven secure with the hardness of the Small Integer Solution (SIS) problem in the random oracle model. The scheme extracts users’ secret-key by using lattice basis delegation with fixed-dimension technique, and hence achieves short secret-keys and short signatures.

Key words: lattice-based cryptography, blind signature, anti-quantum attack, small integer solution

中图分类号: