Skip to main content
placeholder image

Efficient Unique Ring Signatures from Lattices

Chapter


Abstract


  • Unique ring signatures (URS) were introduced by Franklin and Zhang (FC 2012) as a unification of linkable and traceable ring signatures. In URS, each member within a ring can only produce, on behalf of the ring, at most one signature for a message. Applications of URS potentially are e���voting systems and e���token systems. In blockchain technology, URS have been implemented for mixing contract. However, existing URS schemes are based on the Discrete Logarithm Problem, which is insecure in the post-quantum setting. In this paper, we design a new lattice-based URS scheme where the signature size is logarithmic in number of ring members. The proposed URS exploits a Merkle tree-based accumulator as building block in the lattice setting. Our scheme is secure under the Short Integer Solution and Learning With Rounding assumptions in the random oracle model.

Publication Date


  • 2022

Edition


Citation


  • Nguyen, T. N., Ta, A. T., Le, H. Q., Duong, D. H., Susilo, W., Guo, F., . . . Kiyomoto, S. (2022). Efficient Unique Ring Signatures from Lattices. In Unknown Book (Vol. 13555 LNCS, pp. 447-466). doi:10.1007/978-3-031-17146-8_22

International Standard Book Number (isbn) 13


  • 9783031171451

Scopus Eid


  • 2-s2.0-85140732281

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 447

End Page


  • 466

Place Of Publication


Abstract


  • Unique ring signatures (URS) were introduced by Franklin and Zhang (FC 2012) as a unification of linkable and traceable ring signatures. In URS, each member within a ring can only produce, on behalf of the ring, at most one signature for a message. Applications of URS potentially are e���voting systems and e���token systems. In blockchain technology, URS have been implemented for mixing contract. However, existing URS schemes are based on the Discrete Logarithm Problem, which is insecure in the post-quantum setting. In this paper, we design a new lattice-based URS scheme where the signature size is logarithmic in number of ring members. The proposed URS exploits a Merkle tree-based accumulator as building block in the lattice setting. Our scheme is secure under the Short Integer Solution and Learning With Rounding assumptions in the random oracle model.

Publication Date


  • 2022

Edition


Citation


  • Nguyen, T. N., Ta, A. T., Le, H. Q., Duong, D. H., Susilo, W., Guo, F., . . . Kiyomoto, S. (2022). Efficient Unique Ring Signatures from Lattices. In Unknown Book (Vol. 13555 LNCS, pp. 447-466). doi:10.1007/978-3-031-17146-8_22

International Standard Book Number (isbn) 13


  • 9783031171451

Scopus Eid


  • 2-s2.0-85140732281

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 447

End Page


  • 466

Place Of Publication