格上基于盆景树模型的环签名A Lattice-based Ring - 电子与信息学报.PDF

第 32 卷第 10 期 电 子 与 信 息 学 报 Vol.32No.10 2010 年 10 月 Journal of Electronics Information Technology Oct..2010 格上基于盆景树模型的环签名 王凤和①② 胡予濮① 王春晓③ ①(西安电子科技大学计算机网络与信息安全教育部重点实验室 西安 710071) ②(泰山学院数学与系统科学学院 泰安 271021) ③(山东建筑大学理学院 济南 250101) 摘 要：基于格上 SIS(Short Integral Solution)问题的困难性假设，在盆景树模型下，利用盆景树签名构造了一个 格上的环签名。环签名的安全性是基于格上 SIS 问题的困难性。方案实现了签名者身份的完全匿名性，在标准模型 下(无随机预言机)证明环签名方案满足存在性不可伪造。 关键词：密码学；环签名；格；盆景树；基向量 中图分类号：TP309 文献标识码： A 文章编号：1009-5896(2010)10-2400-04 DOI: 10.3724/SP.J.1146.2009.01491 A Lattice-based Ring Signature Scheme from Bonsai Trees ①② ① ③ Wang Feng-he Hu Yu-pu Wang Chun-xiao ① (Key Laboratory of Computer Networks Information Security of Ministry of Education, Xidian University, Xi’an 710071, China) ② (Dept. of Mathematics, Taishan Collage., Taian 271021, China) ③ (Dept. of Mathematic and physics. Shandong Jianzhu University, Jinan 250101, China) Abstract: Under the hard assumption of SIS (Short Integral Solution), a lattice-based ring signature scheme in bonsai tree model is proposed, which based on the bonsai tree signature scheme. Security of proposed ring signature is based on the hardness of SIS. The privacy of signer is guaranteed in proposed ring signature. This ring signature is also unforgeability, which is proved in the standard model (without random oracle). Key words: Cryptography; Ring signature; Lattice; Bonsai trees; Basis vectors