Journal of Frontiers of Computer Science and Technology ›› 2017, Vol. 11 ›› Issue (12): 1965-1971.DOI: 10.3778/j.issn.1673-9418.1611022

Previous Articles     Next Articles

Lattice-Based Identity-Based Blind Signature Scheme in Standard Model

TANG Yongli, ZHOU Jin, LIU Kun, YE Qing+, YAN Xixi   

  1. College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan 454000, China
  • Online:2017-12-01 Published:2017-12-07


汤永利,周  锦,刘  琨,叶  青+,闫玺玺   

  1. 河南理工大学 计算机科学与技术学院,河南 焦作 454000

Abstract: The blind signature scheme in the random oracle model relies on the random oracle assumption. The scheme is proven to be secure in theory, but it may not be secure in practice. This paper constructs an identity-based blind signature scheme with lattice in the standard model. A short basis delegation algorithm is introduced to generate the private key. The signature of the message is generated by the forward sampling algorithm proposed by Gentry et al. Under the standard hardness assumption of the small integer solutions problem (SIS), the new scheme is proven to be one-more unforgeable based on Juels and Pointcheval??s security model in the standard model. The comparison results show that the key length and signature length are shorter, and the efficiency is higher.

Key words: lattice, identity-based, standard model, blind signature

摘要: 随机预言模型下的盲签名方案都依赖于随机预言假设,即使方案被证明安全,在实际应用时未必安全。构造了一个标准模型下格上基于身份的盲签名方案。该方案中引入一个短格基派生算法,根据用户的身份产生对应的私钥,并利用Gentry等人提出的原像抽样陷门单向函数产生消息的签名。在标准模型下依据Juels和Pointcheval等人提出的安全模型,基于小整数解问题(small integer solutions,SIS)的困难性,证明了该方案满足one-more不可伪造性。分析表明,与同类方案相比,该方案密钥长度和签名长度有所减小,效率更高。

关键词: 格, 基于身份, 标准模型, 盲签名