ID-based Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings

TL;DR

This paper introduces new ID-based ring and proxy ring signature schemes utilizing bilinear pairings, offering improved efficiency and resolving previous computational inconsistencies in existing schemes.

Contribution

It presents novel ID-based ring and proxy ring signature schemes based on bilinear pairings that are more efficient and address prior computational issues.

Findings

Schemes are more computationally efficient.

Resolves inconsistencies in previous schemes.

Applicable to secure anonymous communications.

Abstract

In 2001, Rivest et al. firstly introduced the concept of ring signatures. A ring signature is a simplified group signature without any manager. It protects the anonymity of a signer. The first scheme proposed by Rivest et al. was based on RSA cryptosystem and certificate based public key setting. The first ring signature scheme based on DLP was proposed by Abe, Ohkubo, and Suzuki. Their scheme is also based on the general certificate-based public key setting too. In 2002, Zhang and Kim proposed a new ID-based ring signature scheme using pairings. Later Lin and Wu proposed a more efficient ID-based ring signature scheme. Both these schemes have some inconsistency in computational aspect. In this paper we propose a new ID-based ring signature scheme and a proxy ring signature scheme. Both the schemes are more efficient than existing one. These schemes also take care of the inconsistencies in above two schemes.