Authors: Shangping Wang; Ru Zhao; Yaling Zhang
Addresses: School of Science, Xi'an University of Technology, 710054 Xi'an Shaanxi, China ' School of Science, Xi'an University of Technology, 710054 Xi'an Shaanxi, China ' School of Computer Science and Engineering, Xi'an University of Technology, 710048 Xi'an Shaanxi, China
Abstract: On the basis of the signatures scheme without trapdoors from lattice, which was proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We prove that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and prove that the security of our scheme can be reduced to the hardness of the small integer solution (SIS) problem by rejection samplings. Compared with the existing lattice-based ring signature schemes, our new scheme is more efficient and with shorter signature length.
Keywords: lattice; ring signature; random oracle model; unforgeable.
International Journal of High Performance Computing and Networking, 2018 Vol.11 No.4, pp.332 - 341
Available online: 05 Jul 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article