Identity-Based Linkable Ring Signature on NTRU Lattice
Yongli Tang, Feifei Xia, Qing Ye, Mengyao Wang, Ruijie Mu, Xiaohang Zhang
Abstract
Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:mi>N</a:mi> <a:mo>≤</a:mo> <a:mn>8</a:mn> </a:math> ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.