Authors: Yunyun Qu; Jiwen Zeng
Addresses: School of Mathematical Sciences, Guizhou Normal University, Guiyang, 550001, China ' School of Mathematical Sciences, Xiamen University, Xiamen, 361005, China
Abstract: As far as we know, there is only one ring signature scheme with multi-designated verifiers in the literature and the scheme is based on the bilinear pairings which need to consume a lot of computation and under the traditional public key infrastructure (PKI). In order to improve computational efficiency and solve the problem of certificate management in PKI, in this paper, we propose the first identity-based ring signature scheme with multi-designated verifiers without pairings. We prove that our novel scheme's unforgeability, anonymity in the random oracle model and indistinguishability in the standard model under the intractability assumption of discrete logarithm problem and decisional Diffie-Hellman problem, and we prove that our novel scheme's non-transferability in the standard model. We compare the new scheme with a previous scheme in terms of computation and communication at last. The results show that our new scheme is more efficient than the previous scheme and is more suitable for the multi-user setting.
Keywords: identity-based ring signature; multi-designated verifiers; discrete logarithm problem; decisional Diffie-Hellman problem.
International Journal of Ad Hoc and Ubiquitous Computing, 2023 Vol.43 No.1, pp.18 - 28
Received: 08 Sep 2021
Received in revised form: 18 Jul 2022
Accepted: 03 Aug 2022
Published online: 17 May 2023 *