We present Raptor, the first practical lattice-based (linkable) ring signature scheme with implementation. Raptor is as fast as classical solutions; while the size of the signature is roughly 1.3 KB per user. Prior to our work, all existing lattice-based solutions are analogues of their discrete-log or pairing-based counterparts. We develop a generic construction of (linkable) ring signatures based on the well-known generic construction from Rivest et al., which is not fully compatible with lattices. Our generic construction is provably secure in random oracle model. We also give instantiations from both standard lattice, as a proof of concept, and NTRU lattice, as an efficient instantiation. We show that the latter construction, called Raptor, is almost as efficient as the classical RST ring signatures and thus may be of practical interest.
CITATION STYLE
Lu, X., Au, M. H., & Zhang, Z. (2019). Raptor: A practical lattice-based (linkable) ring signature. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11464 LNCS, pp. 110–130). Springer Verlag. https://doi.org/10.1007/978-3-030-21568-2_6
Mendeley helps you to discover research relevant for your work.