为了改进盆景树(Bonsaitrees)格基签名方案的实现效率,提出了一个新的格基数字签名方案.在标准模型下,该方案的存在性不可伪造性是基于格上小整数解问题(SIS)的困难性.作为Bonsaitrees签名的一个改进方案,改进方案的公钥长度由Bonsaitrees签名的(2k+1)mnlogq比特缩减为(k+1)mnlogq比特,同时消息的签名长度也由原Bonsaitrees签名的(k+1)mlogq比特缩减到(1+k/2)mlogq比特,能更好地实现签名方案的效率.
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)ran 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 logq bit while the Bonsai trees signature scheme's is (k + 1)rn log q bit. So the proposed signature scheme is more efficient than the Bonsai trees signature.