Welcome to the resource topic for 2022/1322
Title:
Efficient Linkable Ring Signature from Vector Commitment inexplicably named Multratug
Authors: Anton A. Sokolov
Abstract:In this paper we continue our work started in the article ‘Lin2-Xor lemma and Log-size Linkable
Threshold Ring Signature’ by introducing another lemma called Lin2-Choice, which extends the Lin2-Xor lemma,
and creating a general-purpose log-size linkable threshold ring signature scheme of size 2 log 2 (n) + 3l + 3, where n
is the ring size and l is the threshold. The scheme is composed of several public coin honest verifier zero-knowledge
arguments that have computational witness-extended emulation. We use an arbitrary vector commitment argument
as the base building block, providing the possibility to use any concrete scheme for it, as long as the scheme is
honest verifier zero-knowledge and has computational witness-extended emulation. Also, we present an extended
version of our signature of size 2 log 2 (n + l) + 6l + 6, which simultaneously proves the sum of hidden amounts
attached to the signing keys. All this in a prime order group without bilinear parings in which the decisional
Diffie-Hellman assumption holds.
ePrint: https://eprint.iacr.org/2022/1322
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .