Efficient Pairing-Free Provably Secure Scalable Revocable Identity-Based Signature Scheme

Abstract

Revocation functionality is essential for the practical deployment of identity-based cryptosystems because a user’s private key may be corrupted by hacking or the period of a contract expires. Many researchers are focusing on revocable identity-based encryption scheme, while revocable identity-based signature scheme has received limited concentration. Recently, several revocable identity-based signature schemes have been proposed. However, these schemes are not scalable and are vulnerable to signing key exposure attack. In this paper, we first refine the security model of revocable identity-based signature scheme by considering the signing key exposure attack. Then, we propose a pairing-free revocable identity-based signature scheme with signing key exposure resistance. The proposed scheme is more efficient and practical than existing schemes in terms of update cost, sign cost, verification cost and scalability. Finally, we prove the proposed scheme is existentially unforgeable against adaptively chosen message and identity attacks under the standard discrete logarithm assumption in the random oracle model.