Lattice-Based Ring Signature Scheme under the Random Oracle Model
This work addresses the need for secure and efficient ring signatures in cryptography, particularly for privacy-preserving applications, but it is incremental as it builds directly on prior lattice-based schemes.
The authors tackled the problem of constructing efficient lattice-based ring signatures by extending a trapdoor-free signature scheme, resulting in a scheme that is strongly unforgeable under the random oracle model and more efficient with shorter signatures than existing methods.
On the basis of the signatures scheme without trapdoors from lattice, which is 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 proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved 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.