An efficient lattice-based linkable ring signature scheme with scalability to multiple layer
In this paper, we propose a novel lattice-based linkable ring signature scheme based on the Borromean ring signature. In our scheme, to avoid the extra overhead caused by reject sampling that used in the existing schemes, we use an exact indistinguishable distribution to replace it. Using our method...
Saved in:
Published in | Journal of ambient intelligence and humanized computing Vol. 13; no. 3; pp. 1547 - 1556 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.03.2022
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we propose a novel lattice-based linkable ring signature scheme based on the Borromean ring signature. In our scheme, to avoid the extra overhead caused by reject sampling that used in the existing schemes, we use an exact indistinguishable distribution to replace it. Using our method, signature will be successfully generated without repeating, so the size of the signature can be reduced. Furthermore, our scheme can be extended to multiple layers easily. We also propose a lattice-based multilayer linkable ring signature scheme which can be use for transactions with multiple inputs. Then, we prove that our scheme has unforgeability, anonymity, linkability and non-slanderability that a linkable ring signature scheme should have. Efficiency analysis shows that our scheme has a smaller signature size under the same security conditions. |
---|---|
ISSN: | 1868-5137 1868-5145 |
DOI: | 10.1007/s12652-021-03092-1 |