• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Efficient Signature Schemes from R-LWE

Vol. 10, No. 8, August 30, 2016
10.3837/tiis.2016.08.026, Download Paper (Free):


Compared to the classical cryptography, lattice-based cryptography is more secure, flexible and simple, and it is believed to be secure against quantum computers. In this paper, an efficient signature scheme is proposed from the ring learning with errors (R-LWE), which avoids sampling from discrete Gaussians and has the characteristics of the much simpler description etc. Then, the scheme is implemented in C/C++ and makes a comparison with the RSA signature scheme in detail. Additionally, a linearly homomorphic signature scheme without trapdoor is proposed from the R-LWE assumption. The security of the above two schemes are reducible to the worst-case hardness of shortest vectors on ideal lattices. The security analyses indicate the proposed schemes are unforgeable under chosen message attack model, and the efficiency analyses also show that the above schemes are much more efficient than other correlative signature schemes.


Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article

[IEEE Style]
T. Wang, J. Yu, P. Zhang and Y. Zhang, "Efficient Signature Schemes from R-LWE," KSII Transactions on Internet and Information Systems, vol. 10, no. 8, pp. 3911-3924, 2016. DOI: 10.3837/tiis.2016.08.026.

[ACM Style]
Ting Wang, Jianping Yu, Peng Zhang, and Yong Zhang. 2016. Efficient Signature Schemes from R-LWE. KSII Transactions on Internet and Information Systems, 10, 8, (2016), 3911-3924. DOI: 10.3837/tiis.2016.08.026.