Shorter Linkable Ring Signature Based on Middle-Product Learning with Errors Problem
Authors:
- 21 October 2022
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (12) , 2974-2989
Abstract
DualRing is a novel generic construction introduced by Yuen et al. (CRYPTO’21), which can transform a special kind of (Type-T*) canonical identification scheme to a ring signature scheme. Compared with the classical approaches, this method can get a shorter signature. In this paper, we construct a new middle-product learning with errors (MPLWE)-based ring signature scheme by using this framework. Specifically, we propose a new MPLWE-based identification scheme, which is compatible with the DualRing, then we obtain a ring signature scheme by using DualRing framework. We also show how to achieve linkability from this ring signature by using a collision resistant hash function. In the end, we provide available parameter options for our (linkable) ring signature scheme. Under these parameters, the signature size of our linkable ring signature is |$2-40 \times $| shorter (depending on the ring size) than the previous MPLWE-based scheme by Das et al. (Africacrypt’19).Keywords
Funding Information
- National Key Research and Development Program of China (2021YFA1000600)
This publication has 17 references indexed in Scilit:
- Ring Confidential TransactionsLedger, 2016
- On the concrete hardness of Learning with ErrorsJournal of Mathematical Cryptology, 2015
- Linkable Ring Signature with Unconditional AnonymityIEEE Transactions on Knowledge and Data Engineering, 2013
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-SecurityIEEE Transactions on Information Theory, 2008
- Short Linkable Ring Signatures Revisited2006
- Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation2005
- Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups2004
- Security Arguments for Digital Signatures and Blind SignaturesJournal of Cryptology, 2000
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993