A Group Ring-Based Provably Secure and Efficient Identity-Based Signature Scheme

Due to the advent of polynomial time quantum algorithms to solve well-known hard mathematical problems, various secure cryptographic primitives are vulnerable against large quantum computers. However, no such quantum algorithm is available to solve hard mathematical problems in group ring. In this paper, we present a group ring-based provably secure identity-based signature scheme (IBSS). Generally, in case of random oracle model (ROM), the response of hash function may not always be random which results in the false security of any cryptographic scheme. We show that our IBSS is secure under standard model rather than ROM and its security relies on the computational Diffie–Hellman assumption in group ring, which is a hard problem even on a quantum computer. We compare our IBSS with several other renowned schemes and show that its computational complexity is low, which makes it useful for achieving authenticity in wireless sensor networks, Internet of things, etc.