Efficient Unique Ring Signatures From Lattices

Tuong Ngoc Nguyen; Anh The Ta; Huy Quoc Le; Dung Hoang Duong; Willy Susilo; Fuchun Guo; Kazuhide Fukushima; Shinsaku Kiyomoto

Paper 2022/1070

Efficient Unique Ring Signatures From Lattices

Tuong Ngoc Nguyen

, Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong

Anh The Ta

, AI Lab, FPT Software Ltd., Ho Chi Minh City, Vietnam

Huy Quoc Le

, Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong

Dung Hoang Duong

, Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong

Willy Susilo

, Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong

Fuchun Guo

, Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong

Kazuhide Fukushima

, Information Security Laboratory, KDDI Research, Inc

Shinsaku Kiyomoto

, Information Security Laboratory, KDDI Research, Inc

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 has been implemented for mixing contracts. 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 the number of ring members. The proposed URS exploits a Merkle tree-based accumulator as a 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.

Note: This is the full version of the paper that appears in the 27th European Symposium on Research in Computer Security (ESORICS 2022).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: unique ring signatures lattice-based cryptography Merkle-tree accumulator zero knowledge argument of knowledge
Contact author(s): tuong nguyenng @ gmail com
tatheanhdtvt @ gmail com
huyle84 @ gmail com
hduong @ uow edu au
wsusilo @ uow edu au
fuchun @ uow edu au
ka-fukushima @ kddi-research jp
kiyomoto @ kddilabs jp
History: 2022-08-21: approved; 2022-08-18: received; See all versions
Short URL: https://ia.cr/2022/1070
License: CC0

BibTeX

@misc{cryptoeprint:2022/1070,
      author = {Tuong Ngoc Nguyen and Anh The Ta and Huy Quoc Le and Dung Hoang Duong and Willy Susilo and Fuchun Guo and Kazuhide Fukushima and Shinsaku Kiyomoto},
      title = {Efficient Unique Ring Signatures From Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1070},
      year = {2022},
      url = {https://eprint.iacr.org/2022/1070}
}