J4 ›› 2012, Vol. 39 ›› Issue (4): 57-61+119.doi: 10.3969/j.issn.1001-2400.2012.04.011

• Original Articles • Previous Articles     Next Articles

Lattice-based signature scheme in the standard model

WANG Fenghe1.2;HU Yupu1JIA Yanyan1   

  1. (1. Key Lab. of Computer Networks and Information Security of Ministry of Education, Xidian Univ., Xi'an  710071, China;
    2. Dept. of Mathematics and Physics, Shandong Jianzhu Univ., Jinan  250101, China)
  • Received:2011-05-09 Online:2012-08-20 Published:2012-10-08
  • Contact: WANG Fenghe E-mail:fenghe2166@163.com

Abstract:

To improve the efficiency of the Bonsai trees signature which was proposed in Eurocrypt'10, utilizing the Bonsai trees algorithm, a new lattice-based signature scheme is proposed. Based on the hardness of the short integer solution problem (SIS), the proposed scheme is provably existentially unforgeable under a static chosen-massage attack in the standard model. Moreover, the public-key length of our proposed signature is (k+1)mn log q bit while the bonsai trees signature's is (2k+1)mn log q bit; the signature length of message is (1+k/2)m log q bit while the Bonsai trees signature scheme's is (k+1)m log q bit. So the proposed signature scheme is more efficient than the Bonsai trees signature.

Key words: digital signature, lattice, bonsai trees, short integer solution problem, the standard model

CLC Number: 

  • TP309