Paper 2020/688
Lin2-Xor Lemma and Log-size Linkable Ring Signature
Anton A. Sokolov
Abstract
In this paper we introduce a novel method for constructing an efficient linkable ring signature without a trusted setup in a group where decisional Diffie-Hellman problem is hard and no bilinear pairings exist. Our linkable ring signature is logarithmic in the size of the signer anonymity set, its verification complexity is linear in the anonymity set size and logarithmic in the signer threshold. A range of the recently proposed setup-free logarithmic size signatures is based on the commitment-to-zero proving system by Groth and Kohlweiss or on the Bulletproofs inner-product compression method by Bünz et al. In contrast, we construct our signature from scratch using the Lin2-Xor and Lin2-Selector lemmas that we formulate and prove here. With these lemmas we construct an n-move public coin special honest verifier zero-knowledge membership proof protocol and instantiate the protocol in the form of a general-purpose setup-free signer-ambiguous linkable ring signature in the random oracle model.
Metadata
- Available format(s)
- Category
- Applications
- Publication info
- Preprint. MINOR revision.
- Keywords
- ring signaturelinkable ring signaturelog-size signaturemembership proofsigner-ambiguityzero- knowledgedisjunctive proof
- Contact author(s)
- acmxddk @ gmail com
- History
- 2024-03-14: last of 11 revisions
- 2020-06-09: received
- See all versions
- Short URL
- https://ia.cr/2020/688
- License
-
CC BY