A novel and efficient undeniable signature scheme based on group ring

The concept of undeniable signature scheme was proposed by Chaum and Antwerpen in 1989. In this scheme, the signature can only be verified by the verifier with the co-operation of the signer. In this paper, we propose a novel undeniable signature scheme based on the structure of group ring. We consider the well studied hard problems, that is, inverse computation problem (ICP) and discrete logarithm problem (DLP) in group ring and show that under the chosen message attack, our scheme is strongly unforgeable, invisible and secure against impersonation attack. These security notions, that is, strongly unforgeability, invisibility and impersonation are defined through three different games. In order to practically realize the scheme, we discuss a case study in which we generate the signature for a message and then verify it through the verification algorithm. Finally, we compare our scheme with several other renowned schemes available in the literature and show it is efficient in terms of the total execution time.